./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5758efa3 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_3.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 b34e199f0da2018b0ae97fc3f9a24725315a1b16 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3.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 b34e199f0da2018b0ae97fc3f9a24725315a1b16 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5758efa [2019-11-26 20:42:38,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:42:38,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:42:38,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:42:38,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:42:38,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:42:38,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:42:38,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:42:38,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:42:38,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:42:38,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:42:38,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:42:38,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:42:38,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:42:38,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:42:38,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:42:38,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:42:38,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:42:38,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:42:38,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:42:38,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:42:38,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:42:38,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:42:38,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:42:38,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:42:38,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:42:38,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:42:38,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:42:38,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:42:38,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:42:38,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:42:38,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:42:38,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:42:38,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:42:38,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:42:38,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:42:38,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:42:38,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:42:38,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:42:38,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:42:38,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:42:38,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-26 20:42:38,140 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:42:38,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:42:38,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:42:38,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:42:38,142 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:42:38,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:42:38,143 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 20:42:38,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:42:38,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:42:38,144 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 20:42:38,144 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 20:42:38,144 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 20:42:38,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:42:38,145 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 20:42:38,145 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:42:38,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:42:38,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:42:38,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:42:38,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:42:38,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:42:38,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:42:38,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:42:38,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 20:42:38,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 20:42:38,148 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 -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2019-11-26 20:42:38,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:42:38,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:42:38,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:42:38,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:42:38,518 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:42:38,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-26 20:42:38,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78328f60/c7a986ad3c3248d5a8f78b6d0771d7da/FLAG466900d36 [2019-11-26 20:42:39,249 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:42:39,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-26 20:42:39,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78328f60/c7a986ad3c3248d5a8f78b6d0771d7da/FLAG466900d36 [2019-11-26 20:42:39,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78328f60/c7a986ad3c3248d5a8f78b6d0771d7da [2019-11-26 20:42:39,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:42:39,456 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 20:42:39,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:42:39,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:42:39,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:42:39,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:42:39" (1/1) ... [2019-11-26 20:42:39,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f57c6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:39, skipping insertion in model container [2019-11-26 20:42:39,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:42:39" (1/1) ... [2019-11-26 20:42:39,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:42:39,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:42:40,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:42:40,029 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 20:42:40,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:42:40,171 INFO L208 MainTranslator]: Completed translation [2019-11-26 20:42:40,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40 WrapperNode [2019-11-26 20:42:40,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:42:40,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 20:42:40,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 20:42:40,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 20:42:40,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (1/1) ... [2019-11-26 20:42:40,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (1/1) ... [2019-11-26 20:42:40,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (1/1) ... [2019-11-26 20:42:40,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (1/1) ... [2019-11-26 20:42:40,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (1/1) ... [2019-11-26 20:42:40,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (1/1) ... [2019-11-26 20:42:40,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (1/1) ... [2019-11-26 20:42:40,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 20:42:40,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 20:42:40,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 20:42:40,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 20:42:40,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (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-26 20:42:40,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 20:42:40,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 20:42:40,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-26 20:42:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 20:42:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 20:42:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-26 20:42:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-26 20:42:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-26 20:42:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 20:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 20:42:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 20:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 20:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 20:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 20:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 20:42:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 20:42:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 20:42:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 20:42:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 20:42:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 20:42:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 20:42:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 20:42:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 20:42:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 20:42:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 20:42:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 20:42:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 20:42:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 20:42:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 20:42:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 20:42:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 20:42:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 20:42:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 20:42:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 20:42:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 20:42:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 20:42:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 20:42:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 20:42:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 20:42:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 20:42:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 20:42:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 20:42:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 20:42:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 20:42:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 20:42:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 20:42:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 20:42:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 20:42:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 20:42:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 20:42:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 20:42:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 20:42:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 20:42:40,319 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 20:42:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 20:42:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 20:42:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 20:42:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 20:42:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 20:42:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 20:42:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 20:42:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 20:42:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 20:42:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 20:42:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 20:42:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-26 20:42:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 20:42:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 20:42:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 20:42:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 20:42:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 20:42:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 20:42:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 20:42:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 20:42:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 20:42:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 20:42:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 20:42:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 20:42:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 20:42:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 20:42:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 20:42:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 20:42:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 20:42:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 20:42:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 20:42:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 20:42:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 20:42:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 20:42:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 20:42:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 20:42:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 20:42:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 20:42:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 20:42:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 20:42:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 20:42:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 20:42:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 20:42:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 20:42:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 20:42:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 20:42:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 20:42:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 20:42:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 20:42:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 20:42:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-26 20:42:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-26 20:42:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-26 20:42:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-26 20:42:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-26 20:42:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-26 20:42:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-26 20:42:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-26 20:42:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-26 20:42:40,336 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-26 20:42:40,337 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-26 20:42:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-26 20:42:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-26 20:42:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-26 20:42:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-26 20:42:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-26 20:42:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-26 20:42:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-26 20:42:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-26 20:42:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-26 20:42:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-26 20:42:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-26 20:42:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-26 20:42:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-26 20:42:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-26 20:42:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-26 20:42:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-26 20:42:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 20:42:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 20:42:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 20:42:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 20:42:41,059 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 20:42:41,060 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 20:42:41,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:42:41 BoogieIcfgContainer [2019-11-26 20:42:41,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 20:42:41,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 20:42:41,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 20:42:41,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 20:42:41,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 08:42:39" (1/3) ... [2019-11-26 20:42:41,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8c408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:42:41, skipping insertion in model container [2019-11-26 20:42:41,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:40" (2/3) ... [2019-11-26 20:42:41,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8c408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:42:41, skipping insertion in model container [2019-11-26 20:42:41,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:42:41" (3/3) ... [2019-11-26 20:42:41,075 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-26 20:42:41,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 20:42:41,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-26 20:42:41,107 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-26 20:42:41,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 20:42:41,129 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 20:42:41,130 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 20:42:41,130 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 20:42:41,130 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 20:42:41,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 20:42:41,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 20:42:41,131 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 20:42:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-26 20:42:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:42:41,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:41,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:41,167 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989328, now seen corresponding path program 1 times [2019-11-26 20:42:41,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:41,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290661893] [2019-11-26 20:42:41,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:41,646 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-26 20:42:41,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290661893] [2019-11-26 20:42:41,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:41,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 20:42:41,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729217887] [2019-11-26 20:42:41,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:42:41,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:42:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:42:41,676 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-26 20:42:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:42,205 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2019-11-26 20:42:42,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:42:42,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 20:42:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:42,224 INFO L225 Difference]: With dead ends: 97 [2019-11-26 20:42:42,225 INFO L226 Difference]: Without dead ends: 88 [2019-11-26 20:42:42,228 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-26 20:42:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-26 20:42:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-11-26 20:42:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-26 20:42:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2019-11-26 20:42:42,314 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 9 [2019-11-26 20:42:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:42,315 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2019-11-26 20:42:42,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:42:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2019-11-26 20:42:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:42:42,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:42,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:42,317 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:42,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989329, now seen corresponding path program 1 times [2019-11-26 20:42:42,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:42,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358905351] [2019-11-26 20:42:42,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:42,585 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-26 20:42:42,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358905351] [2019-11-26 20:42:42,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:42,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:42:42,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380644201] [2019-11-26 20:42:42,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:42:42,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:42:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:42:42,592 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand 6 states. [2019-11-26 20:42:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:43,426 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2019-11-26 20:42:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:42:43,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-26 20:42:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:43,434 INFO L225 Difference]: With dead ends: 165 [2019-11-26 20:42:43,434 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 20:42:43,435 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-26 20:42:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 20:42:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2019-11-26 20:42:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-26 20:42:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 192 transitions. [2019-11-26 20:42:43,461 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 192 transitions. Word has length 9 [2019-11-26 20:42:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:43,462 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 192 transitions. [2019-11-26 20:42:43,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:42:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2019-11-26 20:42:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 20:42:43,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:43,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:43,464 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:43,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1859028932, now seen corresponding path program 1 times [2019-11-26 20:42:43,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:43,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769422365] [2019-11-26 20:42:43,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:43,860 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-26 20:42:43,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769422365] [2019-11-26 20:42:43,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:43,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:42:43,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509586847] [2019-11-26 20:42:43,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:42:43,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:43,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:42:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:42:43,863 INFO L87 Difference]: Start difference. First operand 134 states and 192 transitions. Second operand 6 states. [2019-11-26 20:42:44,094 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-26 20:42:44,224 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-26 20:42:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:44,984 INFO L93 Difference]: Finished difference Result 246 states and 348 transitions. [2019-11-26 20:42:44,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:42:44,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-26 20:42:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:44,989 INFO L225 Difference]: With dead ends: 246 [2019-11-26 20:42:44,989 INFO L226 Difference]: Without dead ends: 246 [2019-11-26 20:42:44,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:42:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-26 20:42:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 192. [2019-11-26 20:42:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-26 20:42:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 283 transitions. [2019-11-26 20:42:45,042 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 283 transitions. Word has length 10 [2019-11-26 20:42:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:45,042 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 283 transitions. [2019-11-26 20:42:45,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:42:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 283 transitions. [2019-11-26 20:42:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 20:42:45,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:45,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:45,044 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1795322128, now seen corresponding path program 1 times [2019-11-26 20:42:45,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:45,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592870558] [2019-11-26 20:42:45,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:45,294 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-11-26 20:42:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:45,403 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-26 20:42:45,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592870558] [2019-11-26 20:42:45,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:45,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:42:45,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881692357] [2019-11-26 20:42:45,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:42:45,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:42:45,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:42:45,406 INFO L87 Difference]: Start difference. First operand 192 states and 283 transitions. Second operand 6 states. [2019-11-26 20:42:45,641 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-26 20:42:45,788 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-11-26 20:42:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:46,534 INFO L93 Difference]: Finished difference Result 226 states and 305 transitions. [2019-11-26 20:42:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 20:42:46,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-26 20:42:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:46,538 INFO L225 Difference]: With dead ends: 226 [2019-11-26 20:42:46,538 INFO L226 Difference]: Without dead ends: 226 [2019-11-26 20:42:46,538 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-26 20:42:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-26 20:42:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-11-26 20:42:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-26 20:42:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2019-11-26 20:42:46,557 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 11 [2019-11-26 20:42:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:46,558 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2019-11-26 20:42:46,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:42:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2019-11-26 20:42:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 20:42:46,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:46,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:46,560 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -179588794, now seen corresponding path program 1 times [2019-11-26 20:42:46,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:46,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685547784] [2019-11-26 20:42:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:46,703 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-26 20:42:46,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685547784] [2019-11-26 20:42:46,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:46,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:42:46,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728256950] [2019-11-26 20:42:46,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:42:46,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:42:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:42:46,706 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand 7 states. [2019-11-26 20:42:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:47,587 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2019-11-26 20:42:47,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:42:47,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-26 20:42:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:47,591 INFO L225 Difference]: With dead ends: 271 [2019-11-26 20:42:47,591 INFO L226 Difference]: Without dead ends: 271 [2019-11-26 20:42:47,592 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-26 20:42:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-26 20:42:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 223. [2019-11-26 20:42:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-26 20:42:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 325 transitions. [2019-11-26 20:42:47,607 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 325 transitions. Word has length 12 [2019-11-26 20:42:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:47,607 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 325 transitions. [2019-11-26 20:42:47,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:42:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 325 transitions. [2019-11-26 20:42:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 20:42:47,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:47,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:47,609 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1272285230, now seen corresponding path program 1 times [2019-11-26 20:42:47,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:47,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817342750] [2019-11-26 20:42:47,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:47,852 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-26 20:42:47,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817342750] [2019-11-26 20:42:47,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:47,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:42:47,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140152404] [2019-11-26 20:42:47,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:42:47,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:42:47,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:42:47,856 INFO L87 Difference]: Start difference. First operand 223 states and 325 transitions. Second operand 7 states. [2019-11-26 20:42:48,154 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-26 20:42:48,319 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-26 20:42:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:48,863 INFO L93 Difference]: Finished difference Result 255 states and 337 transitions. [2019-11-26 20:42:48,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:42:48,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-26 20:42:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:48,866 INFO L225 Difference]: With dead ends: 255 [2019-11-26 20:42:48,867 INFO L226 Difference]: Without dead ends: 255 [2019-11-26 20:42:48,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:42:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-26 20:42:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2019-11-26 20:42:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-26 20:42:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 323 transitions. [2019-11-26 20:42:48,888 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 323 transitions. Word has length 13 [2019-11-26 20:42:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:48,888 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 323 transitions. [2019-11-26 20:42:48,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:42:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 323 transitions. [2019-11-26 20:42:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 20:42:48,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:48,889 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:48,890 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash 668439832, now seen corresponding path program 1 times [2019-11-26 20:42:48,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:48,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654469168] [2019-11-26 20:42:48,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:49,045 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-26 20:42:49,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654469168] [2019-11-26 20:42:49,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880282103] [2019-11-26 20:42:49,046 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-26 20:42:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:49,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 20:42:49,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:42:49,605 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:42:49,607 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:42:49,608 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-26 20:42:49,608 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:49,708 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-26 20:42:49,710 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:42:49,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-26 20:42:49,774 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-26 20:42:49,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:42:49,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-11-26 20:42:49,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194177229] [2019-11-26 20:42:49,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:42:49,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:42:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:42:49,776 INFO L87 Difference]: Start difference. First operand 223 states and 323 transitions. Second operand 10 states. [2019-11-26 20:42:49,926 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-26 20:42:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:50,808 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2019-11-26 20:42:50,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:42:50,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 20:42:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:50,812 INFO L225 Difference]: With dead ends: 257 [2019-11-26 20:42:50,812 INFO L226 Difference]: Without dead ends: 257 [2019-11-26 20:42:50,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:42:50,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-26 20:42:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 227. [2019-11-26 20:42:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-26 20:42:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2019-11-26 20:42:50,824 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 17 [2019-11-26 20:42:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:50,825 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2019-11-26 20:42:50,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:42:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2019-11-26 20:42:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 20:42:50,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:50,826 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:51,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:42:51,031 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:51,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:51,032 INFO L82 PathProgramCache]: Analyzing trace with hash -753201699, now seen corresponding path program 1 times [2019-11-26 20:42:51,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:51,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76559361] [2019-11-26 20:42:51,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:51,408 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-26 20:42:51,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76559361] [2019-11-26 20:42:51,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656000923] [2019-11-26 20:42:51,409 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-26 20:42:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:51,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 20:42:51,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:42:51,885 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-26 20:42:51,885 INFO L343 Elim1Store]: treesize reduction 487, result has 22.1 percent of original size [2019-11-26 20:42:51,886 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-26 20:42:51,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:51,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:52,143 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:52,659 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 61 [2019-11-26 20:42:52,660 INFO L588 ElimStorePlain]: treesize reduction 12278, result has 1.1 percent of original size [2019-11-26 20:42:52,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:52,669 INFO L508 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-26 20:42:52,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:120, output treesize:134 [2019-11-26 20:42:52,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:52,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:52,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:53,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:54,052 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-26 20:42:55,065 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-26 20:42:55,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:42:55,109 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 49 treesize of output 25 [2019-11-26 20:42:55,110 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:55,242 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-26 20:42:55,242 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:55,249 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 56 treesize of output 28 [2019-11-26 20:42:55,250 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:55,375 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-26 20:42:55,376 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:55,383 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 49 treesize of output 25 [2019-11-26 20:42:55,383 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:55,516 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-26 20:42:55,517 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:55,519 INFO L508 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-26 20:42:55,519 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:307, output treesize:222 [2019-11-26 20:42:55,843 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-26 20:42:55,865 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-26 20:42:55,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:42:55,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2019-11-26 20:42:55,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036275938] [2019-11-26 20:42:55,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 20:42:55,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 20:42:55,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:42:55,868 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand 15 states. [2019-11-26 20:42:56,037 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-26 20:42:56,362 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-26 20:42:58,838 WARN L192 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 195 DAG size of output: 178 [2019-11-26 20:42:59,146 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-26 20:43:01,909 WARN L192 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 229 DAG size of output: 178 [2019-11-26 20:43:02,355 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-26 20:43:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:03,904 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2019-11-26 20:43:03,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 20:43:03,905 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-26 20:43:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:03,907 INFO L225 Difference]: With dead ends: 278 [2019-11-26 20:43:03,907 INFO L226 Difference]: Without dead ends: 278 [2019-11-26 20:43:03,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:43:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-26 20:43:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 233. [2019-11-26 20:43:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-26 20:43:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 326 transitions. [2019-11-26 20:43:03,918 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 326 transitions. Word has length 18 [2019-11-26 20:43:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:03,919 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 326 transitions. [2019-11-26 20:43:03,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 20:43:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 326 transitions. [2019-11-26 20:43:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 20:43:03,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:03,920 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:43:04,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:43:04,125 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1874416105, now seen corresponding path program 1 times [2019-11-26 20:43:04,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:04,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931671075] [2019-11-26 20:43:04,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:04,495 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-26 20:43:04,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931671075] [2019-11-26 20:43:04,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599555008] [2019-11-26 20:43:04,496 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-26 20:43:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:04,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 20:43:04,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:43:04,661 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_35|], 23=[|v_#valid_49|]} [2019-11-26 20:43:04,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,719 INFO L343 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2019-11-26 20:43:04,719 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-26 20:43:04,720 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:04,755 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:04,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:04,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:04,807 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-26 20:43:04,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:04,832 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,183 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-26 20:43:05,185 INFO L588 ElimStorePlain]: treesize reduction 1486, result has 6.2 percent of original size [2019-11-26 20:43:05,186 INFO L508 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-26 20:43:05,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:135, output treesize:99 [2019-11-26 20:43:05,533 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-26 20:43:05,534 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,589 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:05,596 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-26 20:43:05,597 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,647 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:05,648 INFO L508 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-26 20:43:05,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:66 [2019-11-26 20:43:05,733 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-26 20:43:05,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:43:05,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-11-26 20:43:05,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949116466] [2019-11-26 20:43:05,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:43:05,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:05,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:43:05,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:43:05,737 INFO L87 Difference]: Start difference. First operand 233 states and 326 transitions. Second operand 14 states. [2019-11-26 20:43:05,957 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-26 20:43:06,250 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-11-26 20:43:06,540 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-26 20:43:06,853 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-26 20:43:07,420 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-11-26 20:43:07,801 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-26 20:43:08,356 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-26 20:43:08,819 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-26 20:43:09,187 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-11-26 20:43:09,628 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-11-26 20:43:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:10,407 INFO L93 Difference]: Finished difference Result 266 states and 355 transitions. [2019-11-26 20:43:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 20:43:10,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-26 20:43:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:10,410 INFO L225 Difference]: With dead ends: 266 [2019-11-26 20:43:10,410 INFO L226 Difference]: Without dead ends: 266 [2019-11-26 20:43:10,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-11-26 20:43:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-26 20:43:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2019-11-26 20:43:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-26 20:43:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 323 transitions. [2019-11-26 20:43:10,425 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 323 transitions. Word has length 19 [2019-11-26 20:43:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:10,426 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 323 transitions. [2019-11-26 20:43:10,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:43:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 323 transitions. [2019-11-26 20:43:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 20:43:10,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:10,427 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-26 20:43:10,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:43:10,637 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash 550415913, now seen corresponding path program 1 times [2019-11-26 20:43:10,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:10,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91843050] [2019-11-26 20:43:10,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:10,741 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-26 20:43:10,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91843050] [2019-11-26 20:43:10,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:10,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 20:43:10,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964095997] [2019-11-26 20:43:10,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:10,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:10,743 INFO L87 Difference]: Start difference. First operand 233 states and 323 transitions. Second operand 4 states. [2019-11-26 20:43:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:11,098 INFO L93 Difference]: Finished difference Result 331 states and 471 transitions. [2019-11-26 20:43:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:43:11,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-26 20:43:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:11,101 INFO L225 Difference]: With dead ends: 331 [2019-11-26 20:43:11,102 INFO L226 Difference]: Without dead ends: 331 [2019-11-26 20:43:11,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-26 20:43:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-26 20:43:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 312. [2019-11-26 20:43:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-26 20:43:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 461 transitions. [2019-11-26 20:43:11,120 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 461 transitions. Word has length 23 [2019-11-26 20:43:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:11,121 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 461 transitions. [2019-11-26 20:43:11,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 461 transitions. [2019-11-26 20:43:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 20:43:11,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:11,122 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-26 20:43:11,123 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:11,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash 550416137, now seen corresponding path program 1 times [2019-11-26 20:43:11,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:11,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131198888] [2019-11-26 20:43:11,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:43:11,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131198888] [2019-11-26 20:43:11,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:11,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 20:43:11,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527505460] [2019-11-26 20:43:11,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:11,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:11,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:11,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:11,198 INFO L87 Difference]: Start difference. First operand 312 states and 461 transitions. Second operand 4 states. [2019-11-26 20:43:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:11,433 INFO L93 Difference]: Finished difference Result 311 states and 458 transitions. [2019-11-26 20:43:11,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:43:11,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-26 20:43:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:11,437 INFO L225 Difference]: With dead ends: 311 [2019-11-26 20:43:11,438 INFO L226 Difference]: Without dead ends: 311 [2019-11-26 20:43:11,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-26 20:43:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-26 20:43:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-11-26 20:43:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-26 20:43:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 458 transitions. [2019-11-26 20:43:11,450 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 458 transitions. Word has length 23 [2019-11-26 20:43:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:11,450 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 458 transitions. [2019-11-26 20:43:11,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 458 transitions. [2019-11-26 20:43:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 20:43:11,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:11,451 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-26 20:43:11,451 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash -116975829, now seen corresponding path program 1 times [2019-11-26 20:43:11,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:11,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645686254] [2019-11-26 20:43:11,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:11,565 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-26 20:43:11,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645686254] [2019-11-26 20:43:11,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:11,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 20:43:11,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888838965] [2019-11-26 20:43:11,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:11,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:11,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:11,568 INFO L87 Difference]: Start difference. First operand 311 states and 458 transitions. Second operand 4 states. [2019-11-26 20:43:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:11,964 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2019-11-26 20:43:11,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:43:11,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 20:43:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:11,969 INFO L225 Difference]: With dead ends: 381 [2019-11-26 20:43:11,969 INFO L226 Difference]: Without dead ends: 381 [2019-11-26 20:43:11,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-26 20:43:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-26 20:43:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 360. [2019-11-26 20:43:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-26 20:43:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 526 transitions. [2019-11-26 20:43:11,986 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 526 transitions. Word has length 24 [2019-11-26 20:43:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:11,988 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 526 transitions. [2019-11-26 20:43:11,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 526 transitions. [2019-11-26 20:43:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 20:43:11,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:11,993 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-26 20:43:11,994 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash -116968878, now seen corresponding path program 1 times [2019-11-26 20:43:11,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:11,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853914799] [2019-11-26 20:43:11,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,088 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-26 20:43:12,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853914799] [2019-11-26 20:43:12,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:12,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:43:12,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613146034] [2019-11-26 20:43:12,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:12,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:12,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:12,096 INFO L87 Difference]: Start difference. First operand 360 states and 526 transitions. Second operand 4 states. [2019-11-26 20:43:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:12,382 INFO L93 Difference]: Finished difference Result 335 states and 491 transitions. [2019-11-26 20:43:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:43:12,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 20:43:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:12,386 INFO L225 Difference]: With dead ends: 335 [2019-11-26 20:43:12,388 INFO L226 Difference]: Without dead ends: 335 [2019-11-26 20:43:12,388 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-26 20:43:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-26 20:43:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2019-11-26 20:43:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-26 20:43:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 489 transitions. [2019-11-26 20:43:12,403 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 489 transitions. Word has length 24 [2019-11-26 20:43:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:12,404 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 489 transitions. [2019-11-26 20:43:12,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 489 transitions. [2019-11-26 20:43:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:43:12,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:12,410 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-26 20:43:12,411 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 35178027, now seen corresponding path program 1 times [2019-11-26 20:43:12,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:12,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298069529] [2019-11-26 20:43:12,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,536 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-26 20:43:12,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298069529] [2019-11-26 20:43:12,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:12,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:43:12,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379427741] [2019-11-26 20:43:12,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:43:12,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:12,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:43:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:43:12,538 INFO L87 Difference]: Start difference. First operand 333 states and 489 transitions. Second operand 5 states. [2019-11-26 20:43:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:12,772 INFO L93 Difference]: Finished difference Result 242 states and 337 transitions. [2019-11-26 20:43:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:43:12,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-26 20:43:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:12,775 INFO L225 Difference]: With dead ends: 242 [2019-11-26 20:43:12,775 INFO L226 Difference]: Without dead ends: 242 [2019-11-26 20:43:12,776 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-26 20:43:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-26 20:43:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 233. [2019-11-26 20:43:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-26 20:43:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2019-11-26 20:43:12,789 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 33 [2019-11-26 20:43:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:12,789 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2019-11-26 20:43:12,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:43:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2019-11-26 20:43:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:43:12,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:12,792 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-26 20:43:12,793 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash -138461554, now seen corresponding path program 1 times [2019-11-26 20:43:12,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:12,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958821337] [2019-11-26 20:43:12,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:13,001 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-26 20:43:13,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958821337] [2019-11-26 20:43:13,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857782242] [2019-11-26 20:43:13,002 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-26 20:43:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:13,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-26 20:43:13,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:43:13,426 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2019-11-26 20:43:13,426 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-26 20:43:13,427 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-26 20:43:13,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:13,448 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:13,677 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-11-26 20:43:13,678 INFO L588 ElimStorePlain]: treesize reduction 1301, result has 6.8 percent of original size [2019-11-26 20:43:13,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:13,683 INFO L508 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-26 20:43:13,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:95 [2019-11-26 20:43:13,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:14,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:14,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:14,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:14,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:14,847 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 31 treesize of output 59 [2019-11-26 20:43:14,847 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:14,855 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:14,856 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:14,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:14,918 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 31 treesize of output 59 [2019-11-26 20:43:14,919 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:14,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:14,980 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 31 treesize of output 59 [2019-11-26 20:43:14,981 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:14,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:14,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:15,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:15,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:15,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:15,073 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 36 treesize of output 78 [2019-11-26 20:43:15,074 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:15,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:15,132 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 31 treesize of output 59 [2019-11-26 20:43:15,132 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:15,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:15,167 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 31 treesize of output 59 [2019-11-26 20:43:15,167 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:15,411 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-26 20:43:15,411 INFO L588 ElimStorePlain]: treesize reduction 52, result has 81.0 percent of original size [2019-11-26 20:43:15,413 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-26 20:43:15,413 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:527, output treesize:12 [2019-11-26 20:43:15,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:16,008 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-26 20:43:16,087 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-26 20:43:16,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:43:16,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-26 20:43:16,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268860208] [2019-11-26 20:43:16,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:43:16,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:16,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:43:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:43:16,089 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand 12 states. [2019-11-26 20:43:17,509 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-11-26 20:43:18,721 WARN L192 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-26 20:43:34,197 WARN L192 SmtUtils]: Spent 15.36 s on a formula simplification. DAG size of input: 167 DAG size of output: 109 [2019-11-26 20:43:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:40,872 INFO L93 Difference]: Finished difference Result 323 states and 423 transitions. [2019-11-26 20:43:40,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:43:40,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-26 20:43:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:40,875 INFO L225 Difference]: With dead ends: 323 [2019-11-26 20:43:40,876 INFO L226 Difference]: Without dead ends: 321 [2019-11-26 20:43:40,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:43:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-26 20:43:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2019-11-26 20:43:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-26 20:43:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 380 transitions. [2019-11-26 20:43:40,885 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 380 transitions. Word has length 33 [2019-11-26 20:43:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:40,885 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 380 transitions. [2019-11-26 20:43:40,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:43:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 380 transitions. [2019-11-26 20:43:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 20:43:40,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:40,887 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-26 20:43:41,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:43:41,088 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1145602458, now seen corresponding path program 1 times [2019-11-26 20:43:41,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:41,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832757540] [2019-11-26 20:43:41,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,243 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-26 20:43:41,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832757540] [2019-11-26 20:43:41,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:41,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 20:43:41,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802143264] [2019-11-26 20:43:41,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:43:41,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:41,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:43:41,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:43:41,245 INFO L87 Difference]: Start difference. First operand 273 states and 380 transitions. Second operand 7 states. [2019-11-26 20:43:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:41,693 INFO L93 Difference]: Finished difference Result 304 states and 411 transitions. [2019-11-26 20:43:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:43:41,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-26 20:43:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:41,696 INFO L225 Difference]: With dead ends: 304 [2019-11-26 20:43:41,696 INFO L226 Difference]: Without dead ends: 304 [2019-11-26 20:43:41,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:43:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-26 20:43:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-11-26 20:43:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-26 20:43:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 409 transitions. [2019-11-26 20:43:41,706 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 409 transitions. Word has length 35 [2019-11-26 20:43:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:41,707 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 409 transitions. [2019-11-26 20:43:41,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:43:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 409 transitions. [2019-11-26 20:43:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 20:43:41,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:41,708 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-26 20:43:41,708 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1732408472, now seen corresponding path program 1 times [2019-11-26 20:43:41,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:41,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840248639] [2019-11-26 20:43:41,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:42,041 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-26 20:43:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840248639] [2019-11-26 20:43:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308754800] [2019-11-26 20:43:42,042 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-26 20:43:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:42,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-26 20:43:42,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:43:42,483 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:43:42,484 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:43:42,485 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-26 20:43:42,485 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:42,590 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-26 20:43:42,590 INFO L588 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-26 20:43:42,778 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:43:42,779 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:43:42,780 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-26 20:43:42,780 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:42,907 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-26 20:43:42,908 INFO L588 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-26 20:43:42,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:42,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,940 INFO L508 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-26 20:43:42,941 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-26 20:43:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:42,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:42,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:42,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:42,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:42,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:43,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:43,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,030 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:43,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:43,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:43,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,230 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:43,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:43,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:43,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:43,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:43,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:43,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:43,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:43,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:43,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:43,692 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:43,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:43,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:43:43,805 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:43,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:43,887 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 26 treesize of output 96 [2019-11-26 20:43:43,888 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:43,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:43,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:43:43,924 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:43,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:43,980 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 21 treesize of output 61 [2019-11-26 20:43:43,980 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,080 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 26 treesize of output 96 [2019-11-26 20:43:44,080 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,109 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-26 20:43:44,110 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:44,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,147 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 16 treesize of output 26 [2019-11-26 20:43:44,148 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,164 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,165 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,182 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,183 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,244 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 21 treesize of output 61 [2019-11-26 20:43:44,245 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,263 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,264 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,284 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,285 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,304 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,304 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,321 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,321 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:44,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,359 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 26 treesize of output 29 [2019-11-26 20:43:44,359 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,379 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:44,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,383 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 16 treesize of output 10 [2019-11-26 20:43:44,383 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,408 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,408 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,431 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,431 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,450 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,450 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:44,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,471 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 21 treesize of output 10 [2019-11-26 20:43:44,471 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:44,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,528 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-26 20:43:44,528 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,569 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:43:44,571 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,589 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,589 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,607 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,608 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:44,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,678 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-26 20:43:44,679 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,697 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,698 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,717 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,717 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,778 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,779 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 21 treesize of output 61 [2019-11-26 20:43:44,780 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,798 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,798 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:43:44,844 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,864 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:44,864 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:44,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:44,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,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, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 56 [2019-11-26 20:43:44,923 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:43:44,949 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:44,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:44,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:43:44,988 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,007 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,008 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,028 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,028 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,059 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,059 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:45,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,104 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 21 treesize of output 29 [2019-11-26 20:43:45,104 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,123 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,123 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,187 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 26 treesize of output 64 [2019-11-26 20:43:45,188 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,213 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,214 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:45,235 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,239 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 21 treesize of output 10 [2019-11-26 20:43:45,239 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:45,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,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, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 91 [2019-11-26 20:43:45,372 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,389 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,389 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,402 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,402 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:43:45,439 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,460 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,466 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,481 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 21 treesize of output 37 [2019-11-26 20:43:45,482 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,509 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:45,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,526 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,527 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 21 treesize of output 29 [2019-11-26 20:43:45,527 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,542 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,542 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,556 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,556 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,570 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,570 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,584 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,584 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:45,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,637 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-26 20:43:45,638 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:43:45,667 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,682 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,682 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,704 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,704 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,730 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,730 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 16 treesize of output 18 [2019-11-26 20:43:45,730 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,755 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,755 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,771 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,772 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:45,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,861 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 31 treesize of output 91 [2019-11-26 20:43:45,862 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,876 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,877 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,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 11 treesize of output 15 [2019-11-26 20:43:45,898 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,942 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 21 treesize of output 37 [2019-11-26 20:43:45,942 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:45,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:45,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:45,978 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 21 treesize of output 29 [2019-11-26 20:43:45,979 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:45,993 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:45,994 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,009 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,009 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:46,039 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,040 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 16 treesize of output 26 [2019-11-26 20:43:46,040 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,067 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 21 treesize of output 18 [2019-11-26 20:43:46,068 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,082 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,083 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,098 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,098 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:46,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,134 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 21 treesize of output 29 [2019-11-26 20:43:46,135 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,148 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,149 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,194 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 26 treesize of output 37 [2019-11-26 20:43:46,195 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,211 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,211 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:46,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,244 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 16 treesize of output 26 [2019-11-26 20:43:46,245 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:46,274 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,287 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 26 treesize of output 29 [2019-11-26 20:43:46,287 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,305 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,305 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,324 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,324 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 21 treesize of output 18 [2019-11-26 20:43:46,324 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:46,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,346 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 21 treesize of output 10 [2019-11-26 20:43:46,346 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,362 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,362 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:46,389 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,402 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 26 treesize of output 29 [2019-11-26 20:43:46,403 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:43:46,425 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:46,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 20:43:46,442 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,458 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,458 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,473 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,476 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 16 treesize of output 7 [2019-11-26 20:43:46,476 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,489 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,490 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,508 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,509 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,515 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 26 treesize of output 18 [2019-11-26 20:43:46,516 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,530 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,530 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,544 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,544 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,561 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,563 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,569 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 21 treesize of output 18 [2019-11-26 20:43:46,569 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,600 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,600 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,613 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,614 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,627 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,627 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,641 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,641 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,656 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,656 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,670 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,670 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,683 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,684 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,699 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,706 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,708 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,709 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,711 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 26 treesize of output 7 [2019-11-26 20:43:46,712 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,727 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,727 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,744 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,744 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,760 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,760 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,776 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,777 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,800 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,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, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-26 20:43:46,806 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,822 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,822 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,837 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,837 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,854 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,855 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,869 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,869 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,881 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,882 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,896 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,896 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,910 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,913 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,917 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,917 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:46,924 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 31 treesize of output 18 [2019-11-26 20:43:46,924 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,938 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,938 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,951 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,951 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,965 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,965 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:46,978 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:46,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:46,995 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 16 treesize of output 7 [2019-11-26 20:43:46,995 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,009 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,009 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,021 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,022 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,035 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,036 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,050 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,051 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,063 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,063 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,076 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,076 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:47,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:47,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:47,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:47,091 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 16 treesize of output 7 [2019-11-26 20:43:47,092 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,107 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,107 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,121 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-26 20:43:47,122 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,134 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,134 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,146 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,146 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,160 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,160 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,172 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,172 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,183 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,183 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,196 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,197 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,209 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,210 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,223 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,223 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,233 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,234 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,247 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,248 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,259 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,260 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,272 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,272 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,284 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,284 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,302 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,302 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,313 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,313 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,323 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,323 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,334 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,334 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,344 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,344 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,354 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,354 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,366 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,367 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,377 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,377 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,394 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,394 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,405 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,405 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,416 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,417 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,428 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,428 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,439 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,440 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,453 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:47,454 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,588 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-11-26 20:43:47,588 INFO L588 ElimStorePlain]: treesize reduction 812, result has 4.8 percent of original size [2019-11-26 20:43:47,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:47,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:43:47,600 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:47,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-11-26 20:43:47,605 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,622 INFO L588 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-26 20:43:47,622 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,622 INFO L221 ElimStorePlain]: Needed 153 recursive calls to eliminate 7 variables, input treesize:7571, output treesize:10 [2019-11-26 20:43:47,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:47,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:47,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:47,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:47,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:47,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:47,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:47,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:47,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:47,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:47,686 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:47,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:47,870 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 31 treesize of output 115 [2019-11-26 20:43:47,871 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:47,949 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 26 treesize of output 72 [2019-11-26 20:43:47,950 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:47,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:47,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,028 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 26 treesize of output 72 [2019-11-26 20:43:48,029 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:48,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,117 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 31 treesize of output 72 [2019-11-26 20:43:48,118 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,277 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 36 treesize of output 150 [2019-11-26 20:43:48,278 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,314 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 16 treesize of output 26 [2019-11-26 20:43:48,314 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:48,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,353 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 21 treesize of output 26 [2019-11-26 20:43:48,353 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:48,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,435 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 31 treesize of output 72 [2019-11-26 20:43:48,435 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:48,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,495 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 26 treesize of output 45 [2019-11-26 20:43:48,496 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,535 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:48,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,555 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 26 treesize of output 45 [2019-11-26 20:43:48,555 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,593 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-26 20:43:48,594 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,714 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 31 treesize of output 115 [2019-11-26 20:43:48,714 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:48,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,755 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 21 treesize of output 26 [2019-11-26 20:43:48,756 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,837 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 26 treesize of output 72 [2019-11-26 20:43:48,838 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:48,919 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 26 treesize of output 72 [2019-11-26 20:43:48,920 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:48,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:48,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,036 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 31 treesize of output 107 [2019-11-26 20:43:49,037 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,093 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 21 treesize of output 45 [2019-11-26 20:43:49,093 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:49,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,206 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 31 treesize of output 72 [2019-11-26 20:43:49,206 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:49,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,336 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 31 treesize of output 72 [2019-11-26 20:43:49,337 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,390 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 21 treesize of output 45 [2019-11-26 20:43:49,391 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,508 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 31 treesize of output 107 [2019-11-26 20:43:49,509 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,611 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,612 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 26 treesize of output 80 [2019-11-26 20:43:49,612 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:49,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,737 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 36 treesize of output 107 [2019-11-26 20:43:49,738 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,854 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 31 treesize of output 107 [2019-11-26 20:43:49,855 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:49,910 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 21 treesize of output 45 [2019-11-26 20:43:49,911 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:49,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:49,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,076 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 36 treesize of output 158 [2019-11-26 20:43:50,077 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,131 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 21 treesize of output 45 [2019-11-26 20:43:50,132 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:50,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,188 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 26 treesize of output 45 [2019-11-26 20:43:50,189 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:50,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,278 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 31 treesize of output 72 [2019-11-26 20:43:50,279 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,397 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 31 treesize of output 107 [2019-11-26 20:43:50,398 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,434 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 16 treesize of output 26 [2019-11-26 20:43:50,435 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,524 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 26 treesize of output 72 [2019-11-26 20:43:50,525 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,581 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,581 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 21 treesize of output 45 [2019-11-26 20:43:50,582 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,676 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,676 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 21 treesize of output 45 [2019-11-26 20:43:50,677 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,763 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 26 treesize of output 72 [2019-11-26 20:43:50,763 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:50,924 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 36 treesize of output 150 [2019-11-26 20:43:50,925 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:50,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,002 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,003 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 26 treesize of output 72 [2019-11-26 20:43:51,003 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,059 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 21 treesize of output 45 [2019-11-26 20:43:51,060 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,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, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-26 20:43:51,191 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,271 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 26 treesize of output 72 [2019-11-26 20:43:51,271 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,349 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,349 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 26 treesize of output 72 [2019-11-26 20:43:51,350 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:51,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,477 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 36 treesize of output 107 [2019-11-26 20:43:51,478 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,516 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,516 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 16 treesize of output 26 [2019-11-26 20:43:51,516 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,629 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 31 treesize of output 107 [2019-11-26 20:43:51,630 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,666 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 16 treesize of output 26 [2019-11-26 20:43:51,667 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,750 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 26 treesize of output 72 [2019-11-26 20:43:51,750 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,833 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 26 treesize of output 72 [2019-11-26 20:43:51,834 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,957 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:51,957 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 31 treesize of output 115 [2019-11-26 20:43:51,958 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:51,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:51,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,041 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,041 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 26 treesize of output 72 [2019-11-26 20:43:52,042 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-26 20:43:52,082 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:52,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,170 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 31 treesize of output 72 [2019-11-26 20:43:52,171 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,285 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 31 treesize of output 107 [2019-11-26 20:43:52,286 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,410 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 31 treesize of output 115 [2019-11-26 20:43:52,411 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,577 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 36 treesize of output 150 [2019-11-26 20:43:52,579 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,634 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 21 treesize of output 45 [2019-11-26 20:43:52,635 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,693 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 21 treesize of output 45 [2019-11-26 20:43:52,693 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,820 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 31 treesize of output 115 [2019-11-26 20:43:52,821 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,962 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 31 treesize of output 107 [2019-11-26 20:43:52,962 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,051 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,052 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 26 treesize of output 80 [2019-11-26 20:43:53,052 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,194 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 31 treesize of output 115 [2019-11-26 20:43:53,195 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,287 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 31 treesize of output 72 [2019-11-26 20:43:53,288 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,371 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 26 treesize of output 72 [2019-11-26 20:43:53,372 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,415 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 21 treesize of output 26 [2019-11-26 20:43:53,415 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,528 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 31 treesize of output 72 [2019-11-26 20:43:53,529 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,572 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,593 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 26 treesize of output 45 [2019-11-26 20:43:53,593 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,678 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 26 treesize of output 72 [2019-11-26 20:43:53,679 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,764 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 26 treesize of output 72 [2019-11-26 20:43:53,765 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,849 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,850 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 26 treesize of output 72 [2019-11-26 20:43:53,850 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,942 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 26 treesize of output 80 [2019-11-26 20:43:53,942 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,062 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,063 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 31 treesize of output 107 [2019-11-26 20:43:54,064 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,183 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 31 treesize of output 107 [2019-11-26 20:43:54,184 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,311 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 31 treesize of output 115 [2019-11-26 20:43:54,312 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,369 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,370 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 21 treesize of output 45 [2019-11-26 20:43:54,370 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,551 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 36 treesize of output 158 [2019-11-26 20:43:54,553 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,617 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 21 treesize of output 45 [2019-11-26 20:43:54,617 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,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, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-26 20:43:54,708 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,772 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 26 treesize of output 45 [2019-11-26 20:43:54,773 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,837 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 21 treesize of output 45 [2019-11-26 20:43:54,837 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,892 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,960 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,960 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 31 treesize of output 72 [2019-11-26 20:43:54,961 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,016 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 21 treesize of output 45 [2019-11-26 20:43:55,017 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,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, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-26 20:43:55,135 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,194 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 26 treesize of output 45 [2019-11-26 20:43:55,194 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,354 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 36 treesize of output 150 [2019-11-26 20:43:55,355 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,436 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 26 treesize of output 72 [2019-11-26 20:43:55,437 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,575 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,576 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 36 treesize of output 107 [2019-11-26 20:43:55,577 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,616 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 21 treesize of output 26 [2019-11-26 20:43:55,616 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,656 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 21 treesize of output 26 [2019-11-26 20:43:55,656 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,691 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,712 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 26 treesize of output 45 [2019-11-26 20:43:55,713 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,764 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,801 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 31 treesize of output 72 [2019-11-26 20:43:55,802 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,859 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 21 treesize of output 45 [2019-11-26 20:43:55,859 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,031 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 36 treesize of output 158 [2019-11-26 20:43:56,033 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,090 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 26 treesize of output 45 [2019-11-26 20:43:56,091 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,200 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 31 treesize of output 107 [2019-11-26 20:43:56,201 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,240 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,240 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 21 treesize of output 26 [2019-11-26 20:43:56,241 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,324 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 26 treesize of output 80 [2019-11-26 20:43:56,324 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,407 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 26 treesize of output 80 [2019-11-26 20:43:56,407 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,486 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,487 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 26 treesize of output 80 [2019-11-26 20:43:56,487 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,523 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,545 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 26 treesize of output 45 [2019-11-26 20:43:56,545 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,626 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 26 treesize of output 72 [2019-11-26 20:43:56,627 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,654 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 16 treesize of output 15 [2019-11-26 20:43:56,654 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,689 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,694 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 26 treesize of output 21 [2019-11-26 20:43:56,695 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,716 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,721 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 16 treesize of output 10 [2019-11-26 20:43:56,721 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,805 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 26 treesize of output 72 [2019-11-26 20:43:56,805 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,867 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-26 20:43:56,867 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,914 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,946 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 31 treesize of output 67 [2019-11-26 20:43:56,947 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:43:56,990 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,075 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 31 treesize of output 67 [2019-11-26 20:43:57,076 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,157 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 31 treesize of output 67 [2019-11-26 20:43:57,158 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-26 20:43:57,199 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,236 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 26 treesize of output 21 [2019-11-26 20:43:57,236 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,293 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 26 treesize of output 40 [2019-11-26 20:43:57,293 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,315 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 21 treesize of output 10 [2019-11-26 20:43:57,316 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,350 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 26 treesize of output 21 [2019-11-26 20:43:57,351 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,389 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 26 treesize of output 21 [2019-11-26 20:43:57,390 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,443 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 26 treesize of output 40 [2019-11-26 20:43:57,444 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,569 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,570 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 36 treesize of output 110 [2019-11-26 20:43:57,571 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,623 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,661 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,661 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 31 treesize of output 75 [2019-11-26 20:43:57,662 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,720 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 26 treesize of output 40 [2019-11-26 20:43:57,720 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,802 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,900 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 41 treesize of output 153 [2019-11-26 20:43:57,901 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,940 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,957 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,958 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 26 treesize of output 40 [2019-11-26 20:43:57,958 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,989 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,042 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 31 treesize of output 67 [2019-11-26 20:43:58,043 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,104 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 26 treesize of output 48 [2019-11-26 20:43:58,105 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 48 [2019-11-26 20:43:58,169 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,203 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 21 treesize of output 21 [2019-11-26 20:43:58,203 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,270 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,323 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 36 treesize of output 102 [2019-11-26 20:43:58,324 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,353 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,365 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,383 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 26 treesize of output 40 [2019-11-26 20:43:58,383 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,403 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 16 treesize of output 7 [2019-11-26 20:43:58,403 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,431 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,462 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 31 treesize of output 40 [2019-11-26 20:43:58,462 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,490 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,502 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,524 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 26 treesize of output 48 [2019-11-26 20:43:58,525 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,547 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,554 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,566 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 21 treesize of output 29 [2019-11-26 20:43:58,567 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,584 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 20:43:58,586 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,625 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 26 treesize of output 21 [2019-11-26 20:43:58,625 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,652 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 21 treesize of output 10 [2019-11-26 20:43:58,652 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,706 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 26 treesize of output 40 [2019-11-26 20:43:58,706 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,765 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 26 treesize of output 40 [2019-11-26 20:43:58,765 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,802 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 26 treesize of output 21 [2019-11-26 20:43:58,803 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,881 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 31 treesize of output 67 [2019-11-26 20:43:58,882 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,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, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2019-11-26 20:43:58,938 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,988 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 26 treesize of output 40 [2019-11-26 20:43:58,989 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,016 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,031 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,031 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,047 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 31 treesize of output 40 [2019-11-26 20:43:59,048 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,170 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 36 treesize of output 110 [2019-11-26 20:43:59,171 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,200 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,228 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 26 treesize of output 48 [2019-11-26 20:43:59,228 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,264 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 26 treesize of output 21 [2019-11-26 20:43:59,265 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,318 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 21 treesize of output 29 [2019-11-26 20:43:59,318 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,342 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 21 treesize of output 10 [2019-11-26 20:43:59,342 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,374 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 21 treesize of output 21 [2019-11-26 20:43:59,375 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,410 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 21 treesize of output 21 [2019-11-26 20:43:59,411 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,431 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-26 20:43:59,444 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,526 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 31 treesize of output 67 [2019-11-26 20:43:59,526 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,556 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,575 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,607 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 36 treesize of output 67 [2019-11-26 20:43:59,608 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,625 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,644 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 21 treesize of output 29 [2019-11-26 20:43:59,645 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,678 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 21 treesize of output 21 [2019-11-26 20:43:59,679 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,706 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,718 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,735 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 26 treesize of output 40 [2019-11-26 20:43:59,735 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,822 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 31 treesize of output 75 [2019-11-26 20:43:59,822 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,934 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 36 treesize of output 102 [2019-11-26 20:43:59,935 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,968 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,018 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 31 treesize of output 67 [2019-11-26 20:44:00,018 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,042 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,048 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,053 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 21 treesize of output 21 [2019-11-26 20:44:00,054 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,160 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 31 treesize of output 67 [2019-11-26 20:44:00,161 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,237 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 31 treesize of output 75 [2019-11-26 20:44:00,237 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,269 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 26 treesize of output 40 [2019-11-26 20:44:00,270 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,751 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 16 [2019-11-26 20:44:00,752 INFO L588 ElimStorePlain]: treesize reduction 4243, result has 0.4 percent of original size [2019-11-26 20:44:00,757 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-26 20:44:00,758 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,772 INFO L588 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-26 20:44:00,772 INFO L508 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-26 20:44:00,773 INFO L221 ElimStorePlain]: Needed 162 recursive calls to eliminate 8 variables, input treesize:8863, output treesize:14 [2019-11-26 20:44:00,849 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-26 20:44:00,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:44:00,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2019-11-26 20:44:00,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100383544] [2019-11-26 20:44:00,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 20:44:00,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:44:00,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 20:44:00,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-26 20:44:00,851 INFO L87 Difference]: Start difference. First operand 297 states and 409 transitions. Second operand 19 states. [2019-11-26 20:44:01,464 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-26 20:44:11,853 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-26 20:44:12,634 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-26 20:44:14,212 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-26 20:44:14,413 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-11-26 20:44:14,560 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-11-26 20:44:25,126 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-26 20:44:25,739 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-26 20:44:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:44:38,096 INFO L93 Difference]: Finished difference Result 531 states and 667 transitions. [2019-11-26 20:44:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-26 20:44:38,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-26 20:44:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:44:38,101 INFO L225 Difference]: With dead ends: 531 [2019-11-26 20:44:38,101 INFO L226 Difference]: Without dead ends: 531 [2019-11-26 20:44:38,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=681, Invalid=1971, Unknown=0, NotChecked=0, Total=2652 [2019-11-26 20:44:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-26 20:44:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 448. [2019-11-26 20:44:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-26 20:44:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 599 transitions. [2019-11-26 20:44:38,120 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 599 transitions. Word has length 35 [2019-11-26 20:44:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:44:38,121 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 599 transitions. [2019-11-26 20:44:38,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 20:44:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 599 transitions. [2019-11-26 20:44:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 20:44:38,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:44:38,122 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-26 20:44:38,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:44:38,330 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:44:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:44:38,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2659210, now seen corresponding path program 1 times [2019-11-26 20:44:38,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:44:38,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122715971] [2019-11-26 20:44:38,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:44:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:38,659 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-26 20:44:38,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122715971] [2019-11-26 20:44:38,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728650680] [2019-11-26 20:44:38,660 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-26 20:44:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:38,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-26 20:44:38,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:44:38,823 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_38|], 5=[|v_#valid_53|]} [2019-11-26 20:44:38,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:38,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:38,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:38,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:38,993 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-26 20:44:38,994 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-26 20:44:38,995 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-26 20:44:38,995 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:39,074 INFO L588 ElimStorePlain]: treesize reduction 50, result has 59.7 percent of original size [2019-11-26 20:44:39,083 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-26 20:44:39,084 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:44:39,167 INFO L588 ElimStorePlain]: treesize reduction 26, result has 72.9 percent of original size [2019-11-26 20:44:39,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,180 INFO L508 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-26 20:44:39,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:70 [2019-11-26 20:44:39,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:39,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:39,967 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 21 treesize of output 37 [2019-11-26 20:44:39,968 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,018 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,018 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 26 treesize of output 64 [2019-11-26 20:44:40,019 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,069 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 26 treesize of output 64 [2019-11-26 20:44:40,070 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,100 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 21 treesize of output 37 [2019-11-26 20:44:40,100 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,150 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,151 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 26 treesize of output 64 [2019-11-26 20:44:40,151 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,203 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,203 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 26 treesize of output 64 [2019-11-26 20:44:40,204 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,234 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 21 treesize of output 37 [2019-11-26 20:44:40,234 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,249 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 16 treesize of output 18 [2019-11-26 20:44:40,249 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,253 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:44:40,253 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,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 2 case distinctions, treesize of input 21 treesize of output 21 [2019-11-26 20:44:40,273 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,290 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 21 treesize of output 21 [2019-11-26 20:44:40,291 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,309 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 16 treesize of output 18 [2019-11-26 20:44:40,309 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:40,324 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 16 treesize of output 18 [2019-11-26 20:44:40,324 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:40,333 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 21 treesize of output 10 [2019-11-26 20:44:40,334 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 20:44:40,341 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,346 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:44:40,347 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,351 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:44:40,351 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,403 INFO L588 ElimStorePlain]: treesize reduction 267, result has 4.0 percent of original size [2019-11-26 20:44:40,404 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:44:40,404 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:669, output treesize:7 [2019-11-26 20:44:40,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:44:40,832 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-11-26 20:44:40,884 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-26 20:44:40,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:44:40,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2019-11-26 20:44:40,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661904609] [2019-11-26 20:44:40,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 20:44:40,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:44:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 20:44:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-26 20:44:40,887 INFO L87 Difference]: Start difference. First operand 448 states and 599 transitions. Second operand 13 states. [2019-11-26 20:44:41,135 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-26 20:44:41,780 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-26 20:44:42,206 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-11-26 20:44:44,021 WARN L192 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-11-26 20:44:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:44:44,087 INFO L93 Difference]: Finished difference Result 468 states and 606 transitions. [2019-11-26 20:44:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:44:44,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-26 20:44:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:44:44,091 INFO L225 Difference]: With dead ends: 468 [2019-11-26 20:44:44,091 INFO L226 Difference]: Without dead ends: 468 [2019-11-26 20:44:44,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-11-26 20:44:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-26 20:44:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 451. [2019-11-26 20:44:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-26 20:44:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 595 transitions. [2019-11-26 20:44:44,106 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 595 transitions. Word has length 34 [2019-11-26 20:44:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:44:44,106 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 595 transitions. [2019-11-26 20:44:44,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 20:44:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 595 transitions. [2019-11-26 20:44:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 20:44:44,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:44:44,108 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, 1] [2019-11-26 20:44:44,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:44:44,311 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:44:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:44:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1389741599, now seen corresponding path program 1 times [2019-11-26 20:44:44,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:44:44,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047285271] [2019-11-26 20:44:44,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:44:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:44,613 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-26 20:44:44,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047285271] [2019-11-26 20:44:44,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477876978] [2019-11-26 20:44:44,614 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-26 20:44:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:44,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 20:44:44,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:44:44,838 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-26 20:44:44,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 20:44:44,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 18 [2019-11-26 20:44:44,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311265705] [2019-11-26 20:44:44,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:44:44,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:44:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:44:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:44:44,840 INFO L87 Difference]: Start difference. First operand 451 states and 595 transitions. Second operand 6 states. [2019-11-26 20:44:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:44:44,972 INFO L93 Difference]: Finished difference Result 475 states and 617 transitions. [2019-11-26 20:44:44,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:44:44,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-26 20:44:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:44:44,974 INFO L225 Difference]: With dead ends: 475 [2019-11-26 20:44:44,974 INFO L226 Difference]: Without dead ends: 475 [2019-11-26 20:44:44,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-26 20:44:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-26 20:44:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 456. [2019-11-26 20:44:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-26 20:44:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-11-26 20:44:44,990 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 36 [2019-11-26 20:44:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:44:44,991 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-11-26 20:44:44,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:44:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-11-26 20:44:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 20:44:44,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:44:44,992 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-26 20:44:45,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:44:45,196 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:44:45,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:44:45,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1602768999, now seen corresponding path program 1 times [2019-11-26 20:44:45,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:44:45,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927581389] [2019-11-26 20:44:45,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:44:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:45,855 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-26 20:44:45,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927581389] [2019-11-26 20:44:45,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711719692] [2019-11-26 20:44:45,856 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-26 20:44:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:45,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 20:44:45,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:44:46,130 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-26 20:44:46,130 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:46,141 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:46,144 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-26 20:44:46,145 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:46,152 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:46,152 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:44:46,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-26 20:44:46,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:46,234 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-26 20:44:46,234 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:46,246 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:46,250 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-26 20:44:46,250 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:46,260 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:46,261 INFO L508 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-26 20:44:46,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-26 20:44:46,355 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-26 20:44:46,355 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:46,364 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:46,368 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-26 20:44:46,369 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:46,374 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:46,375 INFO L508 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-26 20:44:46,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-26 20:44:46,410 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-26 20:44:46,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:44:46,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 26 [2019-11-26 20:44:46,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807949867] [2019-11-26 20:44:46,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-26 20:44:46,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:44:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-26 20:44:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-11-26 20:44:46,412 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 27 states. [2019-11-26 20:44:46,700 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-26 20:44:46,899 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-11-26 20:44:47,803 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-26 20:44:48,016 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-11-26 20:44:49,147 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-26 20:44:49,384 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-26 20:44:49,533 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-26 20:44:49,727 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-11-26 20:44:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:44:50,112 INFO L93 Difference]: Finished difference Result 504 states and 634 transitions. [2019-11-26 20:44:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-26 20:44:50,113 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-11-26 20:44:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:44:50,116 INFO L225 Difference]: With dead ends: 504 [2019-11-26 20:44:50,116 INFO L226 Difference]: Without dead ends: 504 [2019-11-26 20:44:50,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=539, Invalid=1717, Unknown=0, NotChecked=0, Total=2256 [2019-11-26 20:44:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-26 20:44:50,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 457. [2019-11-26 20:44:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-26 20:44:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 593 transitions. [2019-11-26 20:44:50,135 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 593 transitions. Word has length 37 [2019-11-26 20:44:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:44:50,135 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 593 transitions. [2019-11-26 20:44:50,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-26 20:44:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 593 transitions. [2019-11-26 20:44:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 20:44:50,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:44:50,136 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] [2019-11-26 20:44:50,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:44:50,348 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:44:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:44:50,349 INFO L82 PathProgramCache]: Analyzing trace with hash 304472762, now seen corresponding path program 1 times [2019-11-26 20:44:50,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:44:50,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267790264] [2019-11-26 20:44:50,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:44:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 20:44:50,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267790264] [2019-11-26 20:44:50,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910462817] [2019-11-26 20:44:50,768 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-26 20:44:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:50,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-26 20:44:50,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:44:51,213 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 27 [2019-11-26 20:44:51,214 INFO L343 Elim1Store]: treesize reduction 340, result has 12.1 percent of original size [2019-11-26 20:44:51,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 52 [2019-11-26 20:44:51,215 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:51,258 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:51,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:44:51,260 INFO L508 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-26 20:44:51,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:32, output treesize:59 [2019-11-26 20:44:51,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:44:51,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:44:51,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:44:52,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:44:52,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:44:52,566 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-26 20:44:52,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:52,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 36 treesize of output 182 [2019-11-26 20:44:52,568 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:52,676 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:52,677 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 31 treesize of output 131 [2019-11-26 20:44:52,677 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:52,681 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:44:52,681 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:52,685 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:44:52,685 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:52,689 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:44:52,689 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:52,692 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:44:52,692 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:52,711 INFO L588 ElimStorePlain]: treesize reduction 32, result has 25.6 percent of original size [2019-11-26 20:44:52,712 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:44:52,712 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:252, output treesize:11 [2019-11-26 20:44:52,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:44:53,033 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-26 20:44:53,034 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-26 20:44:53,034 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 18 case distinctions, treesize of input 37 treesize of output 169 [2019-11-26 20:44:53,035 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:53,389 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 81 [2019-11-26 20:44:53,389 INFO L343 Elim1Store]: treesize reduction 80, result has 68.8 percent of original size [2019-11-26 20:44:53,390 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 25 case distinctions, treesize of input 42 treesize of output 207 [2019-11-26 20:44:53,391 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:53,686 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-26 20:44:53,688 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-26 20:44:53,688 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 18 case distinctions, treesize of input 37 treesize of output 169 [2019-11-26 20:44:53,690 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:53,919 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-26 20:44:53,920 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-26 20:44:53,921 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 18 case distinctions, treesize of input 37 treesize of output 169 [2019-11-26 20:44:53,922 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:54,174 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-26 20:44:54,175 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-26 20:44:54,175 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 18 case distinctions, treesize of input 37 treesize of output 169 [2019-11-26 20:44:54,177 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:54,407 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-26 20:44:54,407 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-26 20:44:54,408 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 18 case distinctions, treesize of input 37 treesize of output 169 [2019-11-26 20:44:54,409 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:54,672 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-11-26 20:44:54,673 INFO L588 ElimStorePlain]: treesize reduction 430, result has 35.4 percent of original size [2019-11-26 20:44:54,674 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:44:54,674 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:252, output treesize:11 [2019-11-26 20:44:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:44:54,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:44:54,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2019-11-26 20:44:54,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797643350] [2019-11-26 20:44:54,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-26 20:44:54,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:44:54,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-26 20:44:54,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-11-26 20:44:54,697 INFO L87 Difference]: Start difference. First operand 457 states and 593 transitions. Second operand 20 states. [2019-11-26 20:44:54,878 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-11-26 20:44:55,558 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-26 20:44:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:44:56,088 INFO L93 Difference]: Finished difference Result 510 states and 629 transitions. [2019-11-26 20:44:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 20:44:56,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-11-26 20:44:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:44:56,091 INFO L225 Difference]: With dead ends: 510 [2019-11-26 20:44:56,091 INFO L226 Difference]: Without dead ends: 498 [2019-11-26 20:44:56,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-11-26 20:44:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-26 20:44:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 449. [2019-11-26 20:44:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-26 20:44:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 562 transitions. [2019-11-26 20:44:56,107 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 562 transitions. Word has length 44 [2019-11-26 20:44:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:44:56,108 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-11-26 20:44:56,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-26 20:44:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 562 transitions. [2019-11-26 20:44:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:44:56,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:44:56,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-26 20:44:56,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:44:56,313 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:44:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:44:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash 848721050, now seen corresponding path program 1 times [2019-11-26 20:44:56,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:44:56,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160524908] [2019-11-26 20:44:56,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:44:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:44:57,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160524908] [2019-11-26 20:44:57,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256920696] [2019-11-26 20:44:57,155 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-26 20:44:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:44:57,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 20:44:57,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:44:57,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-26 20:44:57,564 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:57,565 INFO L588 ElimStorePlain]: treesize reduction 4, result has 20.0 percent of original size [2019-11-26 20:44:57,566 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:44:57,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:1 [2019-11-26 20:44:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:44:57,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:44:57,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 27 [2019-11-26 20:44:57,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226947038] [2019-11-26 20:44:57,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-26 20:44:57,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:44:57,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-26 20:44:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-11-26 20:44:57,574 INFO L87 Difference]: Start difference. First operand 449 states and 562 transitions. Second operand 27 states. [2019-11-26 20:44:57,859 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-11-26 20:44:58,074 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-11-26 20:44:58,286 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2019-11-26 20:44:58,520 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-11-26 20:44:58,769 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-11-26 20:44:59,179 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-26 20:44:59,527 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-11-26 20:44:59,815 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-26 20:44:59,978 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-11-26 20:45:00,169 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-11-26 20:45:00,358 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-26 20:45:00,538 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-11-26 20:45:00,862 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-26 20:45:01,060 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-26 20:45:01,264 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-26 20:45:01,422 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-11-26 20:45:01,611 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-26 20:45:01,770 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-26 20:45:02,260 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-26 20:45:02,420 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-26 20:45:02,736 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-26 20:45:03,171 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-26 20:45:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:45:03,544 INFO L93 Difference]: Finished difference Result 703 states and 859 transitions. [2019-11-26 20:45:03,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-26 20:45:03,547 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-11-26 20:45:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:45:03,550 INFO L225 Difference]: With dead ends: 703 [2019-11-26 20:45:03,550 INFO L226 Difference]: Without dead ends: 703 [2019-11-26 20:45:03,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=676, Invalid=2630, Unknown=0, NotChecked=0, Total=3306 [2019-11-26 20:45:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-26 20:45:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 602. [2019-11-26 20:45:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-26 20:45:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 764 transitions. [2019-11-26 20:45:03,570 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 764 transitions. Word has length 45 [2019-11-26 20:45:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:45:03,571 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 764 transitions. [2019-11-26 20:45:03,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-26 20:45:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 764 transitions. [2019-11-26 20:45:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 20:45:03,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:45:03,572 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-26 20:45:03,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:45:03,784 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:45:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:45:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1632248471, now seen corresponding path program 1 times [2019-11-26 20:45:03,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:45:03,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552025856] [2019-11-26 20:45:03,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:45:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:04,248 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-26 20:45:04,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552025856] [2019-11-26 20:45:04,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437036810] [2019-11-26 20:45:04,249 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-26 20:45:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:04,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-26 20:45:04,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:45:04,398 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_40|], 8=[|v_#valid_57|]} [2019-11-26 20:45:04,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:04,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:04,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:04,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:04,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:04,573 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-26 20:45:04,573 INFO L343 Elim1Store]: treesize reduction 86, result has 52.7 percent of original size [2019-11-26 20:45:04,574 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-26 20:45:04,574 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:04,715 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-26 20:45:04,715 INFO L588 ElimStorePlain]: treesize reduction 50, result has 68.6 percent of original size [2019-11-26 20:45:04,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:04,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 239 [2019-11-26 20:45:04,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:04,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:04,738 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,002 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-11-26 20:45:05,003 INFO L588 ElimStorePlain]: treesize reduction 622, result has 13.6 percent of original size [2019-11-26 20:45:05,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,011 INFO L508 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-26 20:45:05,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:98 [2019-11-26 20:45:05,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:05,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,440 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 26 treesize of output 56 [2019-11-26 20:45:05,440 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,470 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 21 treesize of output 29 [2019-11-26 20:45:05,470 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,495 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 16 treesize of output 10 [2019-11-26 20:45:05,495 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,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, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 31 treesize of output 99 [2019-11-26 20:45:05,587 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:05,599 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:05,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:05,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,622 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 32 [2019-11-26 20:45:05,622 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,672 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 26 treesize of output 56 [2019-11-26 20:45:05,672 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,679 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:05,680 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:05,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,727 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 26 treesize of output 48 [2019-11-26 20:45:05,727 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:05,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:05,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,756 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 26 treesize of output 32 [2019-11-26 20:45:05,756 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,767 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 16 treesize of output 10 [2019-11-26 20:45:05,768 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:05,790 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:05,791 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 21 treesize of output 21 [2019-11-26 20:45:05,791 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,796 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:05,797 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:05,802 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:05,803 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:06,003 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-26 20:45:06,004 INFO L588 ElimStorePlain]: treesize reduction 297, result has 33.0 percent of original size [2019-11-26 20:45:06,005 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-26 20:45:06,005 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:951, output treesize:67 [2019-11-26 20:45:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:06,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:07,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:07,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:07,439 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 32 treesize of output 158 [2019-11-26 20:45:07,440 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:07,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:07,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:07,589 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 32 treesize of output 158 [2019-11-26 20:45:07,591 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:07,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:07,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:07,694 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 27 treesize of output 112 [2019-11-26 20:45:07,695 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:07,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:07,790 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:07,791 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 27 treesize of output 104 [2019-11-26 20:45:07,792 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:07,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:07,957 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:07,958 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 32 treesize of output 174 [2019-11-26 20:45:07,959 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:07,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,168 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-26 20:45:08,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,169 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 37 treesize of output 204 [2019-11-26 20:45:08,171 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:08,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,241 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 22 treesize of output 74 [2019-11-26 20:45:08,242 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:08,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,347 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 27 treesize of output 112 [2019-11-26 20:45:08,347 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:08,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,493 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 32 treesize of output 150 [2019-11-26 20:45:08,494 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:08,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,561 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 22 treesize of output 74 [2019-11-26 20:45:08,561 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:08,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,707 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 32 treesize of output 150 [2019-11-26 20:45:08,708 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:08,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,812 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 27 treesize of output 112 [2019-11-26 20:45:08,813 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:08,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:08,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:08,898 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 27 treesize of output 112 [2019-11-26 20:45:08,899 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,480 WARN L192 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 95 [2019-11-26 20:45:09,481 INFO L588 ElimStorePlain]: treesize reduction 1328, result has 20.8 percent of original size [2019-11-26 20:45:09,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-26 20:45:09,488 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-26 20:45:09,494 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,501 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-26 20:45:09,502 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,509 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-26 20:45:09,509 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,516 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 7 treesize of output 3 [2019-11-26 20:45:09,517 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,690 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-26 20:45:09,690 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:09,698 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-26 20:45:09,698 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,714 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 7 treesize of output 3 [2019-11-26 20:45:09,714 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-26 20:45:09,718 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-26 20:45:09,724 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,731 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-26 20:45:09,731 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:09,887 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:45:09,887 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,902 INFO L508 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-26 20:45:09,903 INFO L221 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:795, output treesize:278 [2019-11-26 20:45:09,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:09,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:10,237 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-26 20:45:10,356 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-26 20:45:10,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:45:10,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-11-26 20:45:10,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644367208] [2019-11-26 20:45:10,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 20:45:10,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:45:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 20:45:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:45:10,358 INFO L87 Difference]: Start difference. First operand 602 states and 764 transitions. Second operand 23 states. [2019-11-26 20:45:11,448 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-11-26 20:45:11,818 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-26 20:45:11,981 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-26 20:45:12,343 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-11-26 20:45:13,637 WARN L192 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-11-26 20:45:28,325 WARN L192 SmtUtils]: Spent 5.28 s on a formula simplification. DAG size of input: 226 DAG size of output: 184 [2019-11-26 20:45:31,802 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-26 20:45:34,580 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-11-26 20:45:48,913 WARN L192 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2019-11-26 20:46:09,873 WARN L192 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-26 20:46:10,497 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 148 [2019-11-26 20:46:12,546 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2019-11-26 20:46:21,516 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-26 20:46:22,103 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2019-11-26 20:46:25,055 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-11-26 20:46:33,730 WARN L192 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 169 DAG size of output: 131 [2019-11-26 20:46:34,636 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-26 20:46:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:46:38,912 INFO L93 Difference]: Finished difference Result 731 states and 875 transitions. [2019-11-26 20:46:38,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-26 20:46:38,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-26 20:46:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:46:38,916 INFO L225 Difference]: With dead ends: 731 [2019-11-26 20:46:38,916 INFO L226 Difference]: Without dead ends: 731 [2019-11-26 20:46:38,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=577, Invalid=1861, Unknown=12, NotChecked=0, Total=2450 [2019-11-26 20:46:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-26 20:46:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 648. [2019-11-26 20:46:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-11-26 20:46:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 802 transitions. [2019-11-26 20:46:38,935 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 802 transitions. Word has length 39 [2019-11-26 20:46:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:46:38,935 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 802 transitions. [2019-11-26 20:46:38,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 20:46:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 802 transitions. [2019-11-26 20:46:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:46:38,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:46:38,937 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-26 20:46:39,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:46:39,149 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:46:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:46:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash 801064558, now seen corresponding path program 1 times [2019-11-26 20:46:39,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:46:39,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407248244] [2019-11-26 20:46:39,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:46:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:40,061 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-26 20:46:40,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407248244] [2019-11-26 20:46:40,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614828239] [2019-11-26 20:46:40,062 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-26 20:46:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:40,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-26 20:46:40,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:46:40,228 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_42|], 15=[|v_#valid_58|]} [2019-11-26 20:46:40,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,304 INFO L343 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2019-11-26 20:46:40,304 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-26 20:46:40,305 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:40,350 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:40,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:40,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:40,380 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 148 treesize of output 148 [2019-11-26 20:46:40,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:40,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:40,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:40,383 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:40,505 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-11-26 20:46:40,506 INFO L588 ElimStorePlain]: treesize reduction 283, result has 26.9 percent of original size [2019-11-26 20:46:40,506 INFO L508 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-26 20:46:40,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:104 [2019-11-26 20:46:40,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:40,630 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-26 20:46:40,631 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:40,659 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:40,659 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:46:40,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:53 [2019-11-26 20:46:41,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:41,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:41,292 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-26 20:46:41,294 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:41,438 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-26 20:46:41,439 INFO L588 ElimStorePlain]: treesize reduction 50, result has 72.8 percent of original size [2019-11-26 20:46:41,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,446 INFO L508 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-26 20:46:41,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:107, output treesize:134 [2019-11-26 20:46:41,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:41,947 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-26 20:46:42,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:42,587 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 49 treesize of output 25 [2019-11-26 20:46:42,587 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:42,728 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-26 20:46:42,729 INFO L588 ElimStorePlain]: treesize reduction 28, result has 84.3 percent of original size [2019-11-26 20:46:42,733 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 22 treesize of output 10 [2019-11-26 20:46:42,734 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:42,787 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:42,792 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 49 treesize of output 25 [2019-11-26 20:46:42,792 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:42,840 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:42,844 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 22 treesize of output 10 [2019-11-26 20:46:42,844 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:42,889 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:42,891 INFO L508 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-26 20:46:42,891 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:208, output treesize:84 [2019-11-26 20:46:43,055 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-26 20:46:43,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:46:43,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2019-11-26 20:46:43,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680158070] [2019-11-26 20:46:43,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-26 20:46:43,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:46:43,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-26 20:46:43,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-11-26 20:46:43,058 INFO L87 Difference]: Start difference. First operand 648 states and 802 transitions. Second operand 28 states. [2019-11-26 20:46:43,357 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-26 20:46:43,631 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-11-26 20:46:44,039 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-26 20:46:44,410 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-26 20:46:44,680 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-11-26 20:46:44,938 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-26 20:46:45,322 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 115 [2019-11-26 20:46:45,751 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 104 [2019-11-26 20:46:46,029 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-11-26 20:46:46,368 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-26 20:46:46,650 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-26 20:46:46,982 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-11-26 20:46:47,526 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 129 [2019-11-26 20:46:48,311 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-11-26 20:46:49,111 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2019-11-26 20:46:49,696 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-11-26 20:46:50,094 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2019-11-26 20:46:51,025 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-11-26 20:46:51,546 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-26 20:46:52,171 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-26 20:46:52,570 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-26 20:46:53,184 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-11-26 20:46:53,514 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-26 20:46:53,835 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-26 20:46:54,429 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-26 20:46:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:46:55,653 INFO L93 Difference]: Finished difference Result 716 states and 850 transitions. [2019-11-26 20:46:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-26 20:46:55,654 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-26 20:46:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:46:55,657 INFO L225 Difference]: With dead ends: 716 [2019-11-26 20:46:55,657 INFO L226 Difference]: Without dead ends: 716 [2019-11-26 20:46:55,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=960, Invalid=3461, Unknown=1, NotChecked=0, Total=4422 [2019-11-26 20:46:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-26 20:46:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 647. [2019-11-26 20:46:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-26 20:46:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 792 transitions. [2019-11-26 20:46:55,675 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 792 transitions. Word has length 45 [2019-11-26 20:46:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:46:55,675 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 792 transitions. [2019-11-26 20:46:55,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-26 20:46:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 792 transitions. [2019-11-26 20:46:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 20:46:55,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:46:55,677 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-26 20:46:55,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:46:55,880 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:46:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:46:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1038016890, now seen corresponding path program 1 times [2019-11-26 20:46:55,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:46:55,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33588838] [2019-11-26 20:46:55,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:46:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:56,058 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-26 20:46:56,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33588838] [2019-11-26 20:46:56,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608634235] [2019-11-26 20:46:56,059 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-26 20:46:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:46:56,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 20:46:56,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:46:56,383 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:46:56,384 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:46:56,384 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-26 20:46:56,385 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:56,438 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-26 20:46:56,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:56,440 INFO L508 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-26 20:46:56,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-26 20:46:56,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:56,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:56,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:56,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:57,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:57,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:57,211 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 31 treesize of output 139 [2019-11-26 20:46:57,212 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,213 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,213 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,214 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,214 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,215 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,215 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,215 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,216 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,216 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,216 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,217 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,217 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,219 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:57,219 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,220 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-26 20:46:57,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:57,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:57,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:57,566 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 31 treesize of output 139 [2019-11-26 20:46:57,567 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,568 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,569 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,570 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,570 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,570 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,571 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,571 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,571 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,572 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,572 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,573 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:46:57,573 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,574 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:57,574 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:46:57,574 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-26 20:46:57,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:57,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:46:57,897 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-26 20:46:57,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:46:57,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-26 20:46:57,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945585862] [2019-11-26 20:46:57,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:46:57,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:46:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:46:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:46:57,898 INFO L87 Difference]: Start difference. First operand 647 states and 792 transitions. Second operand 12 states. [2019-11-26 20:46:58,244 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-26 20:46:59,112 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-26 20:46:59,287 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-26 20:47:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:03,615 INFO L93 Difference]: Finished difference Result 686 states and 831 transitions. [2019-11-26 20:47:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:47:03,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-26 20:47:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:03,619 INFO L225 Difference]: With dead ends: 686 [2019-11-26 20:47:03,619 INFO L226 Difference]: Without dead ends: 686 [2019-11-26 20:47:03,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:47:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-26 20:47:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 647. [2019-11-26 20:47:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-26 20:47:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 789 transitions. [2019-11-26 20:47:03,633 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 789 transitions. Word has length 54 [2019-11-26 20:47:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:03,634 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 789 transitions. [2019-11-26 20:47:03,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:47:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 789 transitions. [2019-11-26 20:47:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 20:47:03,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:03,635 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 20:47:03,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:03,841 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1091323427, now seen corresponding path program 1 times [2019-11-26 20:47:03,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:03,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692632697] [2019-11-26 20:47:03,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 20:47:03,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692632697] [2019-11-26 20:47:03,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:47:03,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 20:47:03,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369760377] [2019-11-26 20:47:03,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:47:03,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:47:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:47:03,971 INFO L87 Difference]: Start difference. First operand 647 states and 789 transitions. Second operand 9 states. [2019-11-26 20:47:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:04,439 INFO L93 Difference]: Finished difference Result 397 states and 447 transitions. [2019-11-26 20:47:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:47:04,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-26 20:47:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:04,442 INFO L225 Difference]: With dead ends: 397 [2019-11-26 20:47:04,442 INFO L226 Difference]: Without dead ends: 388 [2019-11-26 20:47:04,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:47:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-26 20:47:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 365. [2019-11-26 20:47:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-26 20:47:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 416 transitions. [2019-11-26 20:47:04,449 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 416 transitions. Word has length 55 [2019-11-26 20:47:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:04,450 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 416 transitions. [2019-11-26 20:47:04,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:47:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 416 transitions. [2019-11-26 20:47:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 20:47:04,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:04,451 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-26 20:47:04,452 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1141925511, now seen corresponding path program 1 times [2019-11-26 20:47:04,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:04,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406592679] [2019-11-26 20:47:04,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:47:04,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406592679] [2019-11-26 20:47:04,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228579473] [2019-11-26 20:47:04,585 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-26 20:47:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:04,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 20:47:04,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:47:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:47:04,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 20:47:04,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-26 20:47:04,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192540169] [2019-11-26 20:47:04,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:47:04,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:47:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:47:04,763 INFO L87 Difference]: Start difference. First operand 365 states and 416 transitions. Second operand 4 states. [2019-11-26 20:47:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:04,786 INFO L93 Difference]: Finished difference Result 364 states and 413 transitions. [2019-11-26 20:47:04,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:47:04,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-26 20:47:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:04,792 INFO L225 Difference]: With dead ends: 364 [2019-11-26 20:47:04,792 INFO L226 Difference]: Without dead ends: 364 [2019-11-26 20:47:04,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:47:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-26 20:47:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2019-11-26 20:47:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-26 20:47:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 413 transitions. [2019-11-26 20:47:04,807 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 413 transitions. Word has length 57 [2019-11-26 20:47:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:04,808 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 413 transitions. [2019-11-26 20:47:04,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:47:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 413 transitions. [2019-11-26 20:47:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 20:47:04,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:04,809 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-26 20:47:05,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:05,013 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2113752430, now seen corresponding path program 1 times [2019-11-26 20:47:05,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:05,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411011638] [2019-11-26 20:47:05,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:05,192 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-26 20:47:05,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411011638] [2019-11-26 20:47:05,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386096549] [2019-11-26 20:47:05,193 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-26 20:47:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:05,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-26 20:47:05,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:47:05,524 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:47:05,525 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:47:05,525 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-26 20:47:05,526 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:05,596 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-26 20:47:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,606 INFO L508 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-26 20:47:05,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:54 [2019-11-26 20:47:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:05,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:05,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:47:05,852 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:05,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:05,902 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 21 treesize of output 61 [2019-11-26 20:47:05,903 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:05,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:05,953 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 21 treesize of output 61 [2019-11-26 20:47:05,953 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:05,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:05,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:47:05,980 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:05,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:05,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:05,993 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,022 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:47:06,023 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,073 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 21 treesize of output 61 [2019-11-26 20:47:06,074 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:06,087 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,101 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,117 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 21 treesize of output 37 [2019-11-26 20:47:06,118 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,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, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-26 20:47:06,132 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,149 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 16 treesize of output 18 [2019-11-26 20:47:06,149 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,161 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:06,161 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,176 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,181 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 31 treesize of output 18 [2019-11-26 20:47:06,181 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:06,195 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,202 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,202 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,203 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,206 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 21 treesize of output 7 [2019-11-26 20:47:06,206 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,215 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,217 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 21 treesize of output 7 [2019-11-26 20:47:06,217 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,224 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,225 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 16 treesize of output 7 [2019-11-26 20:47:06,225 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,232 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,233 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 16 treesize of output 7 [2019-11-26 20:47:06,233 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,238 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,238 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,239 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,240 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,240 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 16 treesize of output 7 [2019-11-26 20:47:06,241 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,248 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 20:47:06,249 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,257 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,260 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,260 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 26 treesize of output 7 [2019-11-26 20:47:06,260 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,269 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 16 treesize of output 7 [2019-11-26 20:47:06,269 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,280 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 26 treesize of output 7 [2019-11-26 20:47:06,280 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,290 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 21 treesize of output 7 [2019-11-26 20:47:06,290 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,297 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,297 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,298 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,300 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 26 treesize of output 7 [2019-11-26 20:47:06,300 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,304 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-26 20:47:06,305 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,310 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,310 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,315 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,315 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,318 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,318 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,322 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,322 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,327 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,327 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,330 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,330 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,366 INFO L588 ElimStorePlain]: treesize reduction 147, result has 4.5 percent of original size [2019-11-26 20:47:06,367 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,367 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-26 20:47:06,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:06,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:47:06,592 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:47:06,624 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:06,637 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:06,650 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,661 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,670 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 21 treesize of output 18 [2019-11-26 20:47:06,670 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,680 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 16 treesize of output 7 [2019-11-26 20:47:06,680 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-26 20:47:06,707 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,723 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,724 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,724 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,730 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 26 treesize of output 18 [2019-11-26 20:47:06,730 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,736 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,738 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,743 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 16 treesize of output 18 [2019-11-26 20:47:06,744 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,784 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 31 treesize of output 37 [2019-11-26 20:47:06,784 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:06,797 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,805 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,811 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 21 treesize of output 7 [2019-11-26 20:47:06,812 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,821 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 16 treesize of output 7 [2019-11-26 20:47:06,821 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:06,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:47:06,834 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,847 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 16 treesize of output 7 [2019-11-26 20:47:06,848 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,857 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 21 treesize of output 7 [2019-11-26 20:47:06,857 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,866 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 21 treesize of output 7 [2019-11-26 20:47:06,867 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,878 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 26 treesize of output 7 [2019-11-26 20:47:06,878 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,886 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 16 treesize of output 7 [2019-11-26 20:47:06,886 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,896 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 21 treesize of output 7 [2019-11-26 20:47:06,896 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,902 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,906 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 21 treesize of output 7 [2019-11-26 20:47:06,907 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,913 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,914 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,915 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,915 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,917 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,917 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 21 treesize of output 7 [2019-11-26 20:47:06,918 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,924 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,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, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-26 20:47:06,936 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,943 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 20:47:06,944 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,949 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,952 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:47:06,952 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 16 treesize of output 7 [2019-11-26 20:47:06,952 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,958 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-26 20:47:06,959 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,964 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,964 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,969 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,969 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,973 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,974 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,978 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,982 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,982 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:06,985 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:06,986 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:07,009 INFO L588 ElimStorePlain]: treesize reduction 90, result has 7.2 percent of original size [2019-11-26 20:47:07,009 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:07,009 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-26 20:47:07,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:07,225 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 17 [2019-11-26 20:47:07,263 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-26 20:47:07,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:47:07,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-26 20:47:07,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985418613] [2019-11-26 20:47:07,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:47:07,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:07,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:47:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:47:07,264 INFO L87 Difference]: Start difference. First operand 364 states and 413 transitions. Second operand 12 states. [2019-11-26 20:47:07,488 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-26 20:47:07,990 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-26 20:47:08,290 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-26 20:47:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:08,569 INFO L93 Difference]: Finished difference Result 383 states and 430 transitions. [2019-11-26 20:47:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 20:47:08,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-26 20:47:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:08,573 INFO L225 Difference]: With dead ends: 383 [2019-11-26 20:47:08,573 INFO L226 Difference]: Without dead ends: 376 [2019-11-26 20:47:08,574 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-26 20:47:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-26 20:47:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2019-11-26 20:47:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-26 20:47:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 403 transitions. [2019-11-26 20:47:08,581 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 403 transitions. Word has length 55 [2019-11-26 20:47:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:08,582 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 403 transitions. [2019-11-26 20:47:08,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:47:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 403 transitions. [2019-11-26 20:47:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-26 20:47:08,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:08,583 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-26 20:47:08,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:08,787 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1039952525, now seen corresponding path program 1 times [2019-11-26 20:47:08,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:08,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547986642] [2019-11-26 20:47:08,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:47:08,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547986642] [2019-11-26 20:47:08,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667706173] [2019-11-26 20:47:08,915 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-26 20:47:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:09,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 20:47:09,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:47:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:47:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 20:47:09,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-26 20:47:09,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959189503] [2019-11-26 20:47:09,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:47:09,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:47:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:47:09,072 INFO L87 Difference]: Start difference. First operand 357 states and 403 transitions. Second operand 4 states. [2019-11-26 20:47:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:09,127 INFO L93 Difference]: Finished difference Result 356 states and 399 transitions. [2019-11-26 20:47:09,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:47:09,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-26 20:47:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:09,130 INFO L225 Difference]: With dead ends: 356 [2019-11-26 20:47:09,130 INFO L226 Difference]: Without dead ends: 356 [2019-11-26 20:47:09,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:47:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-26 20:47:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2019-11-26 20:47:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-26 20:47:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 399 transitions. [2019-11-26 20:47:09,140 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 399 transitions. Word has length 58 [2019-11-26 20:47:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:09,140 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 399 transitions. [2019-11-26 20:47:09,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:47:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 399 transitions. [2019-11-26 20:47:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-26 20:47:09,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:09,165 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-26 20:47:09,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:09,368 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2121210039, now seen corresponding path program 1 times [2019-11-26 20:47:09,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:09,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562297738] [2019-11-26 20:47:09,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:47:09,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562297738] [2019-11-26 20:47:09,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130960018] [2019-11-26 20:47:09,487 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-26 20:47:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:09,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-26 20:47:09,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:47:09,663 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-26 20:47:09,663 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:09,665 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:09,666 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:09,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 20:47:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:47:09,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 20:47:09,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-26 20:47:09,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32438749] [2019-11-26 20:47:09,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:47:09,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:47:09,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:47:09,680 INFO L87 Difference]: Start difference. First operand 356 states and 399 transitions. Second operand 4 states. [2019-11-26 20:47:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:09,793 INFO L93 Difference]: Finished difference Result 373 states and 411 transitions. [2019-11-26 20:47:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:47:09,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-26 20:47:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:09,796 INFO L225 Difference]: With dead ends: 373 [2019-11-26 20:47:09,796 INFO L226 Difference]: Without dead ends: 367 [2019-11-26 20:47:09,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:47:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-11-26 20:47:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 350. [2019-11-26 20:47:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-26 20:47:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 390 transitions. [2019-11-26 20:47:09,807 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 390 transitions. Word has length 59 [2019-11-26 20:47:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:09,807 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 390 transitions. [2019-11-26 20:47:09,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:47:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 390 transitions. [2019-11-26 20:47:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 20:47:09,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:09,810 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-26 20:47:10,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:10,015 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2138604831, now seen corresponding path program 1 times [2019-11-26 20:47:10,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:10,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523753679] [2019-11-26 20:47:10,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:10,325 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-26 20:47:10,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523753679] [2019-11-26 20:47:10,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019894085] [2019-11-26 20:47:10,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 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-26 20:47:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:10,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-26 20:47:10,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:47:10,478 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_45|], 9=[|v_#valid_61|]} [2019-11-26 20:47:10,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,565 INFO L343 Elim1Store]: treesize reduction 142, result has 12.9 percent of original size [2019-11-26 20:47:10,566 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-26 20:47:10,566 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:10,599 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:10,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:10,622 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 52 treesize of output 46 [2019-11-26 20:47:10,622 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:10,678 INFO L588 ElimStorePlain]: treesize reduction 13, result has 82.7 percent of original size [2019-11-26 20:47:10,678 INFO L508 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-26 20:47:10,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:62 [2019-11-26 20:47:10,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:10,782 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-26 20:47:10,782 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:10,803 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:10,803 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:10,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-26 20:47:10,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:10,883 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-26 20:47:10,884 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:10,903 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:10,904 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:10,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-26 20:47:11,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:11,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:11,315 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-26 20:47:11,316 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:11,400 INFO L588 ElimStorePlain]: treesize reduction 34, result has 67.9 percent of original size [2019-11-26 20:47:11,406 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-26 20:47:11,406 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:11,440 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:11,444 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-26 20:47:11,444 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:11,473 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:11,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,477 INFO L508 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-26 20:47:11,477 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:58 [2019-11-26 20:47:11,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:11,704 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-26 20:47:11,825 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-26 20:47:11,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:47:11,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2019-11-26 20:47:11,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203960901] [2019-11-26 20:47:11,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-26 20:47:11,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:11,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-26 20:47:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:47:11,827 INFO L87 Difference]: Start difference. First operand 350 states and 390 transitions. Second operand 21 states. [2019-11-26 20:47:12,051 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-26 20:47:12,273 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-26 20:47:12,724 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-26 20:47:12,938 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-26 20:47:13,351 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-26 20:47:13,679 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-26 20:47:13,920 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-26 20:47:14,362 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-26 20:47:14,698 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2019-11-26 20:47:15,090 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-26 20:47:15,377 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-26 20:47:15,801 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-26 20:47:16,234 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-26 20:47:17,277 WARN L192 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-11-26 20:47:17,978 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-26 20:47:19,525 WARN L192 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 151 [2019-11-26 20:47:20,774 WARN L192 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-26 20:47:23,697 WARN L192 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-11-26 20:47:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:25,090 INFO L93 Difference]: Finished difference Result 372 states and 405 transitions. [2019-11-26 20:47:25,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-26 20:47:25,091 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-11-26 20:47:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:25,092 INFO L225 Difference]: With dead ends: 372 [2019-11-26 20:47:25,092 INFO L226 Difference]: Without dead ends: 372 [2019-11-26 20:47:25,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=542, Invalid=1714, Unknown=0, NotChecked=0, Total=2256 [2019-11-26 20:47:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-26 20:47:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 349. [2019-11-26 20:47:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-26 20:47:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 384 transitions. [2019-11-26 20:47:25,097 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 384 transitions. Word has length 60 [2019-11-26 20:47:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:25,098 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 384 transitions. [2019-11-26 20:47:25,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-26 20:47:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 384 transitions. [2019-11-26 20:47:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-26 20:47:25,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:25,099 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:47:25,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:25,300 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash -201285117, now seen corresponding path program 1 times [2019-11-26 20:47:25,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:25,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013003125] [2019-11-26 20:47:25,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:47:25,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013003125] [2019-11-26 20:47:25,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936183698] [2019-11-26 20:47:25,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:25,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-26 20:47:25,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:47:26,000 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:47:26,000 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:47:26,001 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-26 20:47:26,001 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:26,052 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-26 20:47:26,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:47:26,054 INFO L508 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-26 20:47:26,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-26 20:47:26,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:47:26,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:47:26,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:47:26,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:47:26,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:47:26,917 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:47:26,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:26,919 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-26 20:47:26,920 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:27,034 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 31 treesize of output 139 [2019-11-26 20:47:27,035 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,037 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:27,037 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,038 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:27,038 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,038 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:27,039 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,039 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:27,039 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,040 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:47:27,040 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,046 INFO L588 ElimStorePlain]: treesize reduction 29, result has 9.4 percent of original size [2019-11-26 20:47:27,047 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,047 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-26 20:47:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:47:27,224 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:47:27,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:27,225 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-26 20:47:27,226 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,399 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:47:27,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:27,400 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-26 20:47:27,401 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,605 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:47:27,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:27,606 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-26 20:47:27,607 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:27,777 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:47:27,778 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:27,778 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-26 20:47:27,779 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:28,018 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-26 20:47:28,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:28,019 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-26 20:47:28,021 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:28,192 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:47:28,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:28,193 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-26 20:47:28,194 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:28,336 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:47:28,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:28,337 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-26 20:47:28,338 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:28,557 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-11-26 20:47:28,559 INFO L588 ElimStorePlain]: treesize reduction 77, result has 62.1 percent of original size [2019-11-26 20:47:28,560 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-26 20:47:28,560 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:261, output treesize:14 [2019-11-26 20:47:28,571 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-26 20:47:28,572 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:28,575 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:28,576 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:28,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-26 20:47:28,620 INFO L343 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2019-11-26 20:47:28,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2019-11-26 20:47:28,621 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:47:28,629 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:28,629 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:47:28,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-26 20:47:28,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 20:47:28,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:47:28,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-26 20:47:28,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601758098] [2019-11-26 20:47:28,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-26 20:47:28,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-26 20:47:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-26 20:47:28,690 INFO L87 Difference]: Start difference. First operand 349 states and 384 transitions. Second operand 20 states. [2019-11-26 20:48:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:05,484 INFO L93 Difference]: Finished difference Result 376 states and 408 transitions. [2019-11-26 20:48:05,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:48:05,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2019-11-26 20:48:05,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:05,486 INFO L225 Difference]: With dead ends: 376 [2019-11-26 20:48:05,486 INFO L226 Difference]: Without dead ends: 376 [2019-11-26 20:48:05,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-11-26 20:48:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-26 20:48:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 348. [2019-11-26 20:48:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-26 20:48:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 383 transitions. [2019-11-26 20:48:05,493 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 383 transitions. Word has length 70 [2019-11-26 20:48:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:05,493 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 383 transitions. [2019-11-26 20:48:05,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-26 20:48:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 383 transitions. [2019-11-26 20:48:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 20:48:05,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:05,495 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:05,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:05,704 INFO L410 AbstractCegarLoop]: === Iteration 33 === [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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:05,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1944871311, now seen corresponding path program 1 times [2019-11-26 20:48:05,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:05,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331783075] [2019-11-26 20:48:05,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:48:06,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331783075] [2019-11-26 20:48:06,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525350149] [2019-11-26 20:48:06,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-26 20:48:06,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:07,067 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-26 20:48:07,067 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,071 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:07,071 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-26 20:48:07,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:07,147 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-26 20:48:07,147 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,151 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:07,151 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-26 20:48:07,298 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-26 20:48:07,298 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,304 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:07,305 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2019-11-26 20:48:07,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:07,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-26 20:48:07,422 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,446 INFO L588 ElimStorePlain]: treesize reduction 18, result has 61.7 percent of original size [2019-11-26 20:48:07,446 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:29 [2019-11-26 20:48:07,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:07,604 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-26 20:48:07,604 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:07,614 INFO L588 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-26 20:48:07,615 INFO L508 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-26 20:48:07,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-26 20:48:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 20:48:07,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:07,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2019-11-26 20:48:07,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808399965] [2019-11-26 20:48:07,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-26 20:48:07,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-26 20:48:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2019-11-26 20:48:07,663 INFO L87 Difference]: Start difference. First operand 348 states and 383 transitions. Second operand 43 states. [2019-11-26 20:48:07,922 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-26 20:48:08,108 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-26 20:48:08,303 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-11-26 20:48:08,621 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-26 20:48:09,349 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-26 20:48:09,518 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-11-26 20:48:09,692 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-11-26 20:48:09,886 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-26 20:48:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:11,183 INFO L93 Difference]: Finished difference Result 391 states and 421 transitions. [2019-11-26 20:48:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-26 20:48:11,183 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2019-11-26 20:48:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:11,185 INFO L225 Difference]: With dead ends: 391 [2019-11-26 20:48:11,185 INFO L226 Difference]: Without dead ends: 391 [2019-11-26 20:48:11,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=570, Invalid=3090, Unknown=0, NotChecked=0, Total=3660 [2019-11-26 20:48:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-26 20:48:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 348. [2019-11-26 20:48:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-26 20:48:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 382 transitions. [2019-11-26 20:48:11,193 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 382 transitions. Word has length 71 [2019-11-26 20:48:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:11,194 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 382 transitions. [2019-11-26 20:48:11,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-26 20:48:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 382 transitions. [2019-11-26 20:48:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-26 20:48:11,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:11,195 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:11,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:11,400 INFO L410 AbstractCegarLoop]: === Iteration 34 === [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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash -710553421, now seen corresponding path program 1 times [2019-11-26 20:48:11,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:11,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296101572] [2019-11-26 20:48:11,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-26 20:48:11,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296101572] [2019-11-26 20:48:11,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661377473] [2019-11-26 20:48:11,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:12,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-26 20:48:12,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:12,426 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:48:12,427 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:48:12,427 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-26 20:48:12,428 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:12,510 INFO L588 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-11-26 20:48:12,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:12,511 INFO L508 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-26 20:48:12,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:58 [2019-11-26 20:48:12,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:12,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:12,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:12,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:12,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:12,971 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:12,972 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 31 treesize of output 139 [2019-11-26 20:48:12,972 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:12,975 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:12,975 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:12,979 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:12,979 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:12,982 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:12,983 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:12,986 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:12,986 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:12,992 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:12,992 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:12,996 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:12,996 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:13,004 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:13,005 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:13,005 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:271, output treesize:7 [2019-11-26 20:48:13,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:13,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:13,441 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:48:13,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:13,442 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 37 treesize of output 244 [2019-11-26 20:48:13,444 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:13,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:13,780 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:48:13,780 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:13,781 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 37 treesize of output 244 [2019-11-26 20:48:13,783 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:13,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:14,108 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-26 20:48:14,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:14,108 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 42 treesize of output 314 [2019-11-26 20:48:14,110 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:14,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:14,353 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:48:14,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:14,354 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 37 treesize of output 244 [2019-11-26 20:48:14,356 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:14,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:14,598 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:48:14,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:14,600 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 37 treesize of output 244 [2019-11-26 20:48:14,601 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:14,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:14,863 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:48:14,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:14,864 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 37 treesize of output 244 [2019-11-26 20:48:14,865 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:14,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:15,074 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:48:15,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:15,075 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 37 treesize of output 244 [2019-11-26 20:48:15,077 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:15,460 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-11-26 20:48:15,461 INFO L588 ElimStorePlain]: treesize reduction 774, result has 25.1 percent of original size [2019-11-26 20:48:15,462 INFO L508 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-26 20:48:15,462 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:306, output treesize:89 [2019-11-26 20:48:15,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:15,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:15,593 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-26 20:48:15,593 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:15,622 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:15,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:15,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:15,656 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-26 20:48:15,657 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:15,680 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:15,680 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-26 20:48:15,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:23 [2019-11-26 20:48:15,721 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-26 20:48:15,722 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:15,725 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:15,725 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:15,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-26 20:48:15,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:15,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:15,866 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-26 20:48:15,866 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 7 case distinctions, treesize of input 27 treesize of output 93 [2019-11-26 20:48:15,867 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:15,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:15,968 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-26 20:48:15,969 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 7 case distinctions, treesize of input 27 treesize of output 93 [2019-11-26 20:48:15,970 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:16,062 INFO L588 ElimStorePlain]: treesize reduction 92, result has 39.9 percent of original size [2019-11-26 20:48:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:16,064 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-26 20:48:16,064 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-11-26 20:48:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:16,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:16,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 20:48:16,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:16,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2019-11-26 20:48:16,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730678972] [2019-11-26 20:48:16,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-26 20:48:16,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-26 20:48:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2019-11-26 20:48:16,275 INFO L87 Difference]: Start difference. First operand 348 states and 382 transitions. Second operand 28 states. [2019-11-26 20:48:16,644 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-11-26 20:48:16,956 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-11-26 20:48:18,151 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-11-26 20:48:18,425 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-11-26 20:48:18,813 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-11-26 20:48:19,081 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 101 [2019-11-26 20:48:19,401 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 108 [2019-11-26 20:48:19,940 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-11-26 20:48:20,199 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-26 20:48:20,784 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-11-26 20:48:20,961 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-26 20:48:21,204 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-26 20:48:21,892 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-11-26 20:48:22,282 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 111 [2019-11-26 20:48:22,982 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 111 [2019-11-26 20:48:23,226 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2019-11-26 20:48:24,571 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-11-26 20:48:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:25,967 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-11-26 20:48:25,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-26 20:48:25,968 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2019-11-26 20:48:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:25,970 INFO L225 Difference]: With dead ends: 376 [2019-11-26 20:48:25,970 INFO L226 Difference]: Without dead ends: 376 [2019-11-26 20:48:25,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=572, Invalid=2850, Unknown=0, NotChecked=0, Total=3422 [2019-11-26 20:48:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-26 20:48:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 347. [2019-11-26 20:48:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-26 20:48:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 381 transitions. [2019-11-26 20:48:25,976 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 381 transitions. Word has length 73 [2019-11-26 20:48:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:25,976 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 381 transitions. [2019-11-26 20:48:25,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-26 20:48:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 381 transitions. [2019-11-26 20:48:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-26 20:48:25,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:25,978 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-26 20:48:26,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:26,187 INFO L410 AbstractCegarLoop]: === Iteration 35 === [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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash -148206892, now seen corresponding path program 1 times [2019-11-26 20:48:26,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:26,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093255794] [2019-11-26 20:48:26,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:48:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:48:26,289 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-26 20:48:26,290 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 20:48:26,326 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-26 20:48:26,334 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-26 20:48:26,335 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-26 20:48:26,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 08:48:26 BoogieIcfgContainer [2019-11-26 20:48:26,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 20:48:26,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 20:48:26,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 20:48:26,382 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 20:48:26,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:42:41" (3/4) ... [2019-11-26 20:48:26,386 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 20:48:26,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 20:48:26,387 INFO L168 Benchmark]: Toolchain (without parser) took 346931.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -64.2 MB). Peak memory consumption was 230.9 MB. Max. memory is 11.5 GB. [2019-11-26 20:48:26,387 INFO L168 Benchmark]: CDTParser took 0.27 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-26 20:48:26,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-26 20:48:26,388 INFO L168 Benchmark]: Boogie Preprocessor took 73.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:48:26,388 INFO L168 Benchmark]: RCFGBuilder took 815.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-11-26 20:48:26,388 INFO L168 Benchmark]: TraceAbstraction took 345318.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -12.7 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. [2019-11-26 20:48:26,389 INFO L168 Benchmark]: Witness Printer took 5.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:48:26,390 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.27 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 713.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 815.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 345318.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -12.7 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification 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)=117, \old(global)=120, \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}] [L708] global = x [L709] 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: 345.1s, OverallIterations: 35, TraceHistogramMax: 5, AutomataDifference: 269.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1656 SDtfs, 12138 SDslu, 3301 SDs, 0 SdLazy, 17339 SolverSat, 4170 SolverUnsat, 62 SolverUnknown, 0 SolverNotchecked, 114.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1726 GetRequests, 930 SyntacticMatches, 79 SemanticMatches, 717 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7257 ImplicationChecksByTransitivity, 140.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=648occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 1106 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 65.4s InterpolantComputationTime, 2274 NumberOfCodeBlocks, 2274 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2144 ConstructedInterpolants, 210 QuantifiedInterpolants, 1742487 SizeOfPredicates, 216 NumberOfNonLiveVariables, 7779 ConjunctsInSsa, 564 ConjunctsInUnsatCore, 55 InterpolantComputations, 17 PerfectInterpolantSequences, 660/1142 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-5758efa [2019-11-26 20:48:28,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:48:28,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:48:28,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:48:28,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:48:28,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:48:28,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:48:28,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:48:28,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:48:28,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:48:28,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:48:28,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:48:28,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:48:28,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:48:28,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:48:28,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:48:28,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:48:28,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:48:28,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:48:28,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:48:28,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:48:28,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:48:28,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:48:28,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:48:28,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:48:28,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:48:28,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:48:28,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:48:28,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:48:28,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:48:28,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:48:28,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:48:28,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:48:28,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:48:28,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:48:28,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:48:28,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:48:28,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:48:28,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:48:28,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:48:28,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:48:28,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-26 20:48:28,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:48:28,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:48:28,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:48:28,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:48:28,508 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:48:28,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:48:28,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 20:48:28,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:48:28,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:48:28,509 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 20:48:28,510 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 20:48:28,510 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 20:48:28,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:48:28,511 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 20:48:28,512 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 20:48:28,512 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 20:48:28,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:48:28,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:48:28,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:48:28,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:48:28,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:48:28,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:48:28,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:48:28,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:48:28,515 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 20:48:28,515 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 20:48:28,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 20:48:28,516 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 -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2019-11-26 20:48:28,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:48:28,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:48:28,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:48:28,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:48:28,863 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:48:28,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-26 20:48:28,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133e6ca6f/ad3c9f7b53ae47beb421ff072ae59a3c/FLAG1727b6e85 [2019-11-26 20:48:29,443 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:48:29,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-26 20:48:29,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133e6ca6f/ad3c9f7b53ae47beb421ff072ae59a3c/FLAG1727b6e85 [2019-11-26 20:48:29,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133e6ca6f/ad3c9f7b53ae47beb421ff072ae59a3c [2019-11-26 20:48:29,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:48:29,812 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 20:48:29,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:48:29,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:48:29,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:48:29,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:48:29" (1/1) ... [2019-11-26 20:48:29,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578a0886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:29, skipping insertion in model container [2019-11-26 20:48:29,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:48:29" (1/1) ... [2019-11-26 20:48:29,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:48:29,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:48:30,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:48:30,375 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 20:48:30,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:48:30,519 INFO L208 MainTranslator]: Completed translation [2019-11-26 20:48:30,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30 WrapperNode [2019-11-26 20:48:30,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:48:30,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 20:48:30,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 20:48:30,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 20:48:30,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (1/1) ... [2019-11-26 20:48:30,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (1/1) ... [2019-11-26 20:48:30,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (1/1) ... [2019-11-26 20:48:30,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (1/1) ... [2019-11-26 20:48:30,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (1/1) ... [2019-11-26 20:48:30,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (1/1) ... [2019-11-26 20:48:30,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (1/1) ... [2019-11-26 20:48:30,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 20:48:30,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 20:48:30,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 20:48:30,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 20:48:30,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (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-26 20:48:30,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 20:48:30,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 20:48:30,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-26 20:48:30,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 20:48:30,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 20:48:30,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 20:48:30,668 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-26 20:48:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-26 20:48:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-26 20:48:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 20:48:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 20:48:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 20:48:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 20:48:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 20:48:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 20:48:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 20:48:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 20:48:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 20:48:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 20:48:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 20:48:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 20:48:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 20:48:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 20:48:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 20:48:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 20:48:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 20:48:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 20:48:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 20:48:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 20:48:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 20:48:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 20:48:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 20:48:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 20:48:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 20:48:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 20:48:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 20:48:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 20:48:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 20:48:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 20:48:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 20:48:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 20:48:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 20:48:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 20:48:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 20:48:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 20:48:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 20:48:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 20:48:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 20:48:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 20:48:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 20:48:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 20:48:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 20:48:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 20:48:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 20:48:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 20:48:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 20:48:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 20:48:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 20:48:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 20:48:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 20:48:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 20:48:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 20:48:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 20:48:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 20:48:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 20:48:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 20:48:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-26 20:48:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 20:48:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 20:48:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 20:48:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 20:48:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 20:48:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 20:48:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 20:48:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 20:48:30,684 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 20:48:30,684 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 20:48:30,684 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 20:48:30,684 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 20:48:30,685 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 20:48:30,685 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 20:48:30,685 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 20:48:30,685 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 20:48:30,685 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 20:48:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 20:48:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 20:48:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 20:48:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 20:48:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 20:48:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 20:48:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 20:48:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 20:48:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 20:48:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 20:48:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 20:48:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 20:48:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 20:48:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 20:48:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 20:48:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 20:48:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 20:48:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 20:48:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 20:48:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 20:48:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 20:48:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 20:48:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 20:48:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 20:48:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 20:48:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 20:48:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 20:48:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 20:48:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 20:48:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 20:48:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 20:48:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 20:48:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-26 20:48:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-26 20:48:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 20:48:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-26 20:48:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-26 20:48:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-26 20:48:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-26 20:48:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-26 20:48:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-26 20:48:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-26 20:48:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-26 20:48:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-26 20:48:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-26 20:48:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-26 20:48:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-26 20:48:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-26 20:48:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-26 20:48:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-26 20:48:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-26 20:48:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-26 20:48:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-26 20:48:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-26 20:48:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-26 20:48:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-26 20:48:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-26 20:48:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-26 20:48:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-26 20:48:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-26 20:48:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-26 20:48:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-26 20:48:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-26 20:48:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-26 20:48:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-26 20:48:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-26 20:48:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-26 20:48:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-26 20:48:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-26 20:48:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-26 20:48:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-26 20:48:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-26 20:48:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-26 20:48:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-26 20:48:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-26 20:48:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-26 20:48:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-26 20:48:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-26 20:48:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-26 20:48:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-26 20:48:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 20:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-26 20:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-26 20:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 20:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-26 20:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 20:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 20:48:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 20:48:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 20:48:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-26 20:48:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 20:48:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 20:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 20:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-26 20:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 20:48:31,404 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 20:48:31,405 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 20:48:31,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:48:31 BoogieIcfgContainer [2019-11-26 20:48:31,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 20:48:31,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 20:48:31,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 20:48:31,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 20:48:31,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 08:48:29" (1/3) ... [2019-11-26 20:48:31,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cc0abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:48:31, skipping insertion in model container [2019-11-26 20:48:31,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:48:30" (2/3) ... [2019-11-26 20:48:31,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cc0abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:48:31, skipping insertion in model container [2019-11-26 20:48:31,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:48:31" (3/3) ... [2019-11-26 20:48:31,415 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-26 20:48:31,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 20:48:31,433 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-26 20:48:31,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-26 20:48:31,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 20:48:31,467 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 20:48:31,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 20:48:31,467 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 20:48:31,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 20:48:31,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 20:48:31,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 20:48:31,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 20:48:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-26 20:48:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:48:31,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:31,498 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:31,499 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-26 20:48:31,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:48:31,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297280903] [2019-11-26 20:48:31,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-26 20:48:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:31,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 20:48:31,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:32,182 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-26 20:48:32,184 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:48:32,185 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-26 20:48:32,187 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:32,272 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-26 20:48:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:32,283 INFO L508 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-26 20:48:32,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-26 20:48:32,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:32,322 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-26 20:48:32,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:48:32,356 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-26 20:48:32,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297280903] [2019-11-26 20:48:32,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:48:32,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 20:48:32,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848203554] [2019-11-26 20:48:32,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:48:32,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:48:32,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:48:32,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:48:32,382 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-26 20:48:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:32,540 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-26 20:48:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:48:32,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 20:48:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:32,554 INFO L225 Difference]: With dead ends: 88 [2019-11-26 20:48:32,555 INFO L226 Difference]: Without dead ends: 82 [2019-11-26 20:48:32,556 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-26 20:48:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-26 20:48:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-11-26 20:48:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 20:48:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-26 20:48:32,613 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 9 [2019-11-26 20:48:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:32,614 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-26 20:48:32,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:48:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-26 20:48:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:48:32,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:32,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:32,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 20:48:32,831 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-26 20:48:32,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:48:32,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924603179] [2019-11-26 20:48:32,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-26 20:48:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:33,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 20:48:33,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:33,397 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:48:33,398 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:48:33,399 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-26 20:48:33,401 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:33,555 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-26 20:48:33,556 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-26 20:48:33,559 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:33,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-26 20:48:33,583 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-26 20:48:33,584 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:48:33,787 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-26 20:48:33,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924603179] [2019-11-26 20:48:33,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:48:33,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 20:48:33,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208198123] [2019-11-26 20:48:33,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:48:33,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:48:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:48:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:48:33,792 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2019-11-26 20:48:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:34,470 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2019-11-26 20:48:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:48:34,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-26 20:48:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:34,474 INFO L225 Difference]: With dead ends: 164 [2019-11-26 20:48:34,474 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 20:48:34,475 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-26 20:48:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 20:48:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2019-11-26 20:48:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-26 20:48:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2019-11-26 20:48:34,500 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 9 [2019-11-26 20:48:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:34,501 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2019-11-26 20:48:34,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:48:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2019-11-26 20:48:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 20:48:34,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:34,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:34,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 20:48:34,723 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-26 20:48:34,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:48:34,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017508213] [2019-11-26 20:48:34,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-26 20:48:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:34,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 20:48:34,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:34,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:34,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:35,305 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2019-11-26 20:48:35,307 INFO L343 Elim1Store]: treesize reduction 360, result has 17.4 percent of original size [2019-11-26 20:48:35,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 163 [2019-11-26 20:48:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:35,311 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:35,523 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-11-26 20:48:35,524 INFO L588 ElimStorePlain]: treesize reduction 181, result has 40.3 percent of original size [2019-11-26 20:48:35,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:35,534 INFO L508 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-26 20:48:35,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:99, output treesize:122 [2019-11-26 20:48:35,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:35,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:35,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-26 20:48:35,795 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:35,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:35,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-26 20:48:35,879 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:35,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:35,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-26 20:48:35,963 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:36,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:36,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-26 20:48:36,025 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:36,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:36,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-26 20:48:36,103 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:36,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:36,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-26 20:48:36,158 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:36,203 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:36,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-26 20:48:36,205 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:36,832 WARN L192 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-11-26 20:48:36,833 INFO L588 ElimStorePlain]: treesize reduction 279, result has 61.8 percent of original size [2019-11-26 20:48:36,838 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-11-26 20:48:36,838 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:730, output treesize:451 [2019-11-26 20:48:37,009 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 39 [2019-11-26 20:48:37,147 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 43 treesize of output 23 [2019-11-26 20:48:37,148 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:37,184 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:37,186 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-26 20:48:37,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:56 [2019-11-26 20:48:37,244 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-26 20:48:37,244 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:48:37,633 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-26 20:48:37,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017508213] [2019-11-26 20:48:37,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:48:37,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:48:37,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620983606] [2019-11-26 20:48:37,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:48:37,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:48:37,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:48:37,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:48:37,635 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand 9 states. [2019-11-26 20:48:38,421 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-11-26 20:48:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:39,608 INFO L93 Difference]: Finished difference Result 245 states and 348 transitions. [2019-11-26 20:48:39,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:48:39,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-26 20:48:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:39,614 INFO L225 Difference]: With dead ends: 245 [2019-11-26 20:48:39,614 INFO L226 Difference]: Without dead ends: 245 [2019-11-26 20:48:39,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:48:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-26 20:48:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 192. [2019-11-26 20:48:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-26 20:48:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2019-11-26 20:48:39,641 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 10 [2019-11-26 20:48:39,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:39,642 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2019-11-26 20:48:39,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:48:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2019-11-26 20:48:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 20:48:39,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:39,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:39,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 20:48:39,848 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-26 20:48:39,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:48:39,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520900113] [2019-11-26 20:48:39,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-26 20:48:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:40,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-26 20:48:40,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:40,127 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_52|], 8=[|v_#valid_69|]} [2019-11-26 20:48:40,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:40,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:40,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:40,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:40,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:40,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:40,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:40,455 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-11-26 20:48:40,456 INFO L343 Elim1Store]: treesize reduction 48, result has 70.0 percent of original size [2019-11-26 20:48:40,456 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 25 treesize of output 117 [2019-11-26 20:48:40,457 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,696 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-11-26 20:48:40,697 INFO L588 ElimStorePlain]: treesize reduction 58, result has 70.1 percent of original size [2019-11-26 20:48:40,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:40,753 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 199 treesize of output 199 [2019-11-26 20:48:40,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:40,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:40,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:40,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:40,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:40,759 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,080 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-11-26 20:48:41,080 INFO L588 ElimStorePlain]: treesize reduction 496, result has 20.1 percent of original size [2019-11-26 20:48:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,088 INFO L508 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-26 20:48:41,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:103, output treesize:125 [2019-11-26 20:48:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,250 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-26 20:48:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:41,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:41,336 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 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-26 20:48:41,336 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:41,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:41,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-26 20:48:41,360 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,375 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:41,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-26 20:48:41,377 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:41,401 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 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-26 20:48:41,401 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:41,419 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:41,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:41,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-26 20:48:41,422 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:41,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-26 20:48:41,438 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,790 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-26 20:48:41,790 INFO L588 ElimStorePlain]: treesize reduction 211, result has 51.3 percent of original size [2019-11-26 20:48:41,794 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2019-11-26 20:48:41,794 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:515, output treesize:222 [2019-11-26 20:48:42,018 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-11-26 20:48:42,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 20:48:42,222 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,318 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:42,326 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 35 treesize of output 19 [2019-11-26 20:48:42,327 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,404 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:42,413 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-26 20:48:42,413 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,485 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:42,495 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-26 20:48:42,496 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,564 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:42,566 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-26 20:48:42,566 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:138, output treesize:83 [2019-11-26 20:48:42,625 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-26 20:48:42,626 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:48:42,891 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:48:43,044 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:48:43,161 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:48:43,269 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:48:43,297 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-26 20:48:43,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520900113] [2019-11-26 20:48:43,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:48:43,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:48:43,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080425768] [2019-11-26 20:48:43,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:48:43,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:48:43,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:48:43,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:48:43,299 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand 9 states. [2019-11-26 20:48:43,645 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-11-26 20:48:43,985 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2019-11-26 20:48:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:45,742 INFO L93 Difference]: Finished difference Result 337 states and 445 transitions. [2019-11-26 20:48:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 20:48:45,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-26 20:48:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:45,748 INFO L225 Difference]: With dead ends: 337 [2019-11-26 20:48:45,749 INFO L226 Difference]: Without dead ends: 337 [2019-11-26 20:48:45,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:48:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-26 20:48:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 268. [2019-11-26 20:48:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-26 20:48:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 398 transitions. [2019-11-26 20:48:45,804 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 398 transitions. Word has length 11 [2019-11-26 20:48:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:45,804 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 398 transitions. [2019-11-26 20:48:45,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:48:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 398 transitions. [2019-11-26 20:48:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 20:48:45,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:45,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:46,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 20:48:46,008 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-26 20:48:46,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:48:46,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965673596] [2019-11-26 20:48:46,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-26 20:48:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:46,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 20:48:46,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:46,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:46,451 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-11-26 20:48:46,451 INFO L343 Elim1Store]: treesize reduction 336, result has 15.2 percent of original size [2019-11-26 20:48:46,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 119 [2019-11-26 20:48:46,453 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:46,594 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-11-26 20:48:46,595 INFO L588 ElimStorePlain]: treesize reduction 49, result has 62.9 percent of original size [2019-11-26 20:48:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:46,600 INFO L508 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-26 20:48:46,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:83 [2019-11-26 20:48:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:46,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:47,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:47,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:47,084 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 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:48:47,085 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:47,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:47,104 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 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:48:47,104 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:47,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:47,112 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:47,113 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-26 20:48:47,113 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:47,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:47,131 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 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:48:47,131 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:47,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:47,150 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 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:48:47,150 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:47,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:47,168 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 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:48:47,168 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:47,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:47,181 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 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:48:47,182 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:47,606 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-26 20:48:47,607 INFO L588 ElimStorePlain]: treesize reduction 100, result has 76.8 percent of original size [2019-11-26 20:48:47,610 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-11-26 20:48:47,610 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:478, output treesize:331 [2019-11-26 20:48:47,779 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-26 20:48:47,779 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:48:48,072 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-26 20:48:48,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965673596] [2019-11-26 20:48:48,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:48:48,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:48:48,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495651829] [2019-11-26 20:48:48,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:48:48,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:48:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:48:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:48:48,081 INFO L87 Difference]: Start difference. First operand 268 states and 398 transitions. Second operand 9 states. [2019-11-26 20:48:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:51,317 INFO L93 Difference]: Finished difference Result 351 states and 486 transitions. [2019-11-26 20:48:51,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:48:51,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-11-26 20:48:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:51,323 INFO L225 Difference]: With dead ends: 351 [2019-11-26 20:48:51,323 INFO L226 Difference]: Without dead ends: 351 [2019-11-26 20:48:51,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:48:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-26 20:48:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 295. [2019-11-26 20:48:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-26 20:48:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 428 transitions. [2019-11-26 20:48:51,345 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 428 transitions. Word has length 12 [2019-11-26 20:48:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:51,346 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 428 transitions. [2019-11-26 20:48:51,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:48:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 428 transitions. [2019-11-26 20:48:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 20:48:51,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:51,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:51,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 20:48:51,561 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-26 20:48:51,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:48:51,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958811128] [2019-11-26 20:48:51,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-26 20:48:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:51,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 20:48:51,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:51,735 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_65|], 4=[|v_#valid_85|]} [2019-11-26 20:48:51,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:51,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:51,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:51,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:52,018 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-26 20:48:52,019 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-26 20:48:52,019 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-26 20:48:52,020 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,192 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-26 20:48:52,193 INFO L588 ElimStorePlain]: treesize reduction 50, result has 64.0 percent of original size [2019-11-26 20:48:52,230 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 97 treesize of output 93 [2019-11-26 20:48:52,231 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,423 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-26 20:48:52,424 INFO L588 ElimStorePlain]: treesize reduction 64, result has 56.8 percent of original size [2019-11-26 20:48:52,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,446 INFO L508 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-26 20:48:52,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:60, output treesize:84 [2019-11-26 20:48:52,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:52,734 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:52,741 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 1 case distinctions, treesize of input 19 treesize of output 17 [2019-11-26 20:48:52,741 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:52,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:52,758 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 19 treesize of output 9 [2019-11-26 20:48:52,758 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,772 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:52,772 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:52,790 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 19 treesize of output 9 [2019-11-26 20:48:52,790 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,798 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:52,798 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:52,811 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:52,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:52,856 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:52,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2019-11-26 20:48:52,886 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:52,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:52,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:52,910 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,923 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:52,923 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:52,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:52,941 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,957 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 19 treesize of output 9 [2019-11-26 20:48:52,957 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,973 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,974 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,975 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:52,975 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:52,989 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,989 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:52,990 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:52,991 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:53,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:53,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:53,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:53,006 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:53,011 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:53,012 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:53,018 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:53,018 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:53,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:53,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:53,034 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-26 20:48:53,034 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:53,394 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-11-26 20:48:53,395 INFO L588 ElimStorePlain]: treesize reduction 342, result has 38.2 percent of original size [2019-11-26 20:48:53,397 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2019-11-26 20:48:53,397 INFO L221 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:1046, output treesize:211 [2019-11-26 20:48:53,588 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-26 20:48:53,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:48:53,850 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-26 20:48:53,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958811128] [2019-11-26 20:48:53,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:48:53,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:48:53,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541074859] [2019-11-26 20:48:53,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:48:53,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:48:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:48:53,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:48:53,852 INFO L87 Difference]: Start difference. First operand 295 states and 428 transitions. Second operand 9 states. [2019-11-26 20:48:54,438 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-11-26 20:48:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:55,484 INFO L93 Difference]: Finished difference Result 356 states and 445 transitions. [2019-11-26 20:48:55,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:48:55,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-26 20:48:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:55,487 INFO L225 Difference]: With dead ends: 356 [2019-11-26 20:48:55,487 INFO L226 Difference]: Without dead ends: 356 [2019-11-26 20:48:55,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-26 20:48:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-26 20:48:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 298. [2019-11-26 20:48:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-26 20:48:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 427 transitions. [2019-11-26 20:48:55,504 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 427 transitions. Word has length 13 [2019-11-26 20:48:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:55,506 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 427 transitions. [2019-11-26 20:48:55,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:48:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 427 transitions. [2019-11-26 20:48:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 20:48:55,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:55,507 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:55,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 20:48:55,713 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:55,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:55,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2063492765, now seen corresponding path program 1 times [2019-11-26 20:48:55,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:48:55,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348830282] [2019-11-26 20:48:55,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-26 20:48:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:55,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 20:48:55,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:55,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:56,216 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2019-11-26 20:48:56,216 INFO L343 Elim1Store]: treesize reduction 429, result has 15.7 percent of original size [2019-11-26 20:48:56,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 237 treesize of output 279 [2019-11-26 20:48:56,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:56,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:56,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:56,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:56,221 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:56,527 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2019-11-26 20:48:56,528 INFO L588 ElimStorePlain]: treesize reduction 491, result has 20.7 percent of original size [2019-11-26 20:48:56,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:56,532 INFO L508 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-26 20:48:56,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:102, output treesize:128 [2019-11-26 20:48:56,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:56,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:56,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:56,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:56,717 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 23 treesize of output 23 [2019-11-26 20:48:56,717 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:56,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:56,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:56,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2019-11-26 20:48:56,730 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:56,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:56,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-26 20:48:56,759 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:56,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:56,783 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 23 treesize of output 23 [2019-11-26 20:48:56,783 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:56,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:56,811 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 23 treesize of output 23 [2019-11-26 20:48:56,811 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:56,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:56,834 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 23 treesize of output 23 [2019-11-26 20:48:56,834 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:56,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:56,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2019-11-26 20:48:56,845 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:57,447 WARN L192 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-26 20:48:57,448 INFO L588 ElimStorePlain]: treesize reduction 225, result has 67.7 percent of original size [2019-11-26 20:48:57,451 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-11-26 20:48:57,451 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:760, output treesize:471 [2019-11-26 20:48:57,689 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 46 [2019-11-26 20:48:57,912 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-26 20:48:57,913 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:57,991 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:57,992 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-26 20:48:57,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:63 [2019-11-26 20:48:58,083 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-26 20:48:58,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:48:58,568 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-26 20:48:58,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348830282] [2019-11-26 20:48:58,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:58,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-26 20:48:58,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293659932] [2019-11-26 20:48:58,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:48:58,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:48:58,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:48:58,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:48:58,570 INFO L87 Difference]: Start difference. First operand 298 states and 427 transitions. Second operand 11 states. [2019-11-26 20:48:59,077 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-11-26 20:48:59,599 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-11-26 20:49:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:01,073 INFO L93 Difference]: Finished difference Result 409 states and 579 transitions. [2019-11-26 20:49:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:49:01,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-26 20:49:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:01,078 INFO L225 Difference]: With dead ends: 409 [2019-11-26 20:49:01,078 INFO L226 Difference]: Without dead ends: 409 [2019-11-26 20:49:01,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:49:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-26 20:49:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 314. [2019-11-26 20:49:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-26 20:49:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 449 transitions. [2019-11-26 20:49:01,095 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 449 transitions. Word has length 18 [2019-11-26 20:49:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:01,095 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 449 transitions. [2019-11-26 20:49:01,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:49:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 449 transitions. [2019-11-26 20:49:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 20:49:01,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:01,097 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:49:01,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 20:49:01,312 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-26 20:49:01,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:01,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704175191] [2019-11-26 20:49:01,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:01,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 20:49:01,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:01,561 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_78|], 9=[|v_#valid_101|]} [2019-11-26 20:49:01,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:01,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:01,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:01,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:01,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:01,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:01,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:01,921 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-26 20:49:01,922 INFO L343 Elim1Store]: treesize reduction 63, result has 65.6 percent of original size [2019-11-26 20:49:01,922 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 27 treesize of output 125 [2019-11-26 20:49:01,923 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,157 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-26 20:49:02,158 INFO L588 ElimStorePlain]: treesize reduction 62, result has 70.9 percent of original size [2019-11-26 20:49:02,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:02,194 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 136 treesize of output 138 [2019-11-26 20:49:02,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,198 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,514 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-26 20:49:02,515 INFO L588 ElimStorePlain]: treesize reduction 171, result has 45.2 percent of original size [2019-11-26 20:49:02,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,522 INFO L508 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-26 20:49:02,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:141 [2019-11-26 20:49:02,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:02,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:02,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:02,740 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 31 treesize of output 23 [2019-11-26 20:49:02,740 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:02,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:02,767 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 31 treesize of output 9 [2019-11-26 20:49:02,767 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,790 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 31 treesize of output 9 [2019-11-26 20:49:02,791 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:02,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:02,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-26 20:49:02,811 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:02,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:02,843 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 31 treesize of output 23 [2019-11-26 20:49:02,844 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:02,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:02,863 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 31 treesize of output 9 [2019-11-26 20:49:02,863 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:02,881 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:02,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-26 20:49:02,882 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:02,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-26 20:49:02,926 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,944 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:02,944 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,953 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:02,954 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:02,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:02,963 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:03,380 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-11-26 20:49:03,380 INFO L588 ElimStorePlain]: treesize reduction 441, result has 37.4 percent of original size [2019-11-26 20:49:03,382 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2019-11-26 20:49:03,382 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:1266, output treesize:263 [2019-11-26 20:49:05,555 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-11-26 20:49:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:05,858 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 27 treesize of output 15 [2019-11-26 20:49:05,858 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:05,939 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:05,946 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-26 20:49:05,946 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:06,011 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:06,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 20:49:06,018 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:06,082 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:06,088 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-26 20:49:06,088 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:06,146 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:06,147 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-26 20:49:06,147 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:128, output treesize:75 [2019-11-26 20:49:06,219 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-26 20:49:06,219 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:49:06,548 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-26 20:49:06,660 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-26 20:49:06,877 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-26 20:49:06,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704175191] [2019-11-26 20:49:06,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:49:06,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-26 20:49:06,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8188693] [2019-11-26 20:49:06,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:49:06,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:49:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:49:06,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:49:06,879 INFO L87 Difference]: Start difference. First operand 314 states and 449 transitions. Second operand 11 states. [2019-11-26 20:49:07,329 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-11-26 20:49:07,623 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-11-26 20:49:07,922 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-11-26 20:49:08,317 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-11-26 20:49:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:11,276 INFO L93 Difference]: Finished difference Result 440 states and 585 transitions. [2019-11-26 20:49:11,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 20:49:11,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-26 20:49:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:11,281 INFO L225 Difference]: With dead ends: 440 [2019-11-26 20:49:11,281 INFO L226 Difference]: Without dead ends: 440 [2019-11-26 20:49:11,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:49:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-26 20:49:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 343. [2019-11-26 20:49:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-26 20:49:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 490 transitions. [2019-11-26 20:49:11,298 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 490 transitions. Word has length 19 [2019-11-26 20:49:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:11,299 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 490 transitions. [2019-11-26 20:49:11,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:49:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 490 transitions. [2019-11-26 20:49:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 20:49:11,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:11,300 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-26 20:49:11,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 20:49:11,513 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602239, now seen corresponding path program 1 times [2019-11-26 20:49:11,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:11,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590031793] [2019-11-26 20:49:11,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:11,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 20:49:11,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:11,680 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-26 20:49:11,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:49:11,691 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-26 20:49:11,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590031793] [2019-11-26 20:49:11,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:49:11,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 20:49:11,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962044975] [2019-11-26 20:49:11,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:49:11,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:49:11,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:49:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:49:11,693 INFO L87 Difference]: Start difference. First operand 343 states and 490 transitions. Second operand 3 states. [2019-11-26 20:49:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:11,720 INFO L93 Difference]: Finished difference Result 504 states and 734 transitions. [2019-11-26 20:49:11,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:49:11,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 20:49:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:11,724 INFO L225 Difference]: With dead ends: 504 [2019-11-26 20:49:11,724 INFO L226 Difference]: Without dead ends: 504 [2019-11-26 20:49:11,724 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-26 20:49:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-26 20:49:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 487. [2019-11-26 20:49:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-26 20:49:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 726 transitions. [2019-11-26 20:49:11,742 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 726 transitions. Word has length 23 [2019-11-26 20:49:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:11,742 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 726 transitions. [2019-11-26 20:49:11,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:49:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 726 transitions. [2019-11-26 20:49:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 20:49:11,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:11,744 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-26 20:49:11,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 20:49:11,960 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602463, now seen corresponding path program 1 times [2019-11-26 20:49:11,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:11,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336343185] [2019-11-26 20:49:11,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:12,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 20:49:12,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:12,129 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-26 20:49:12,129 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:49:12,133 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-26 20:49:12,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336343185] [2019-11-26 20:49:12,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:49:12,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 20:49:12,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082007241] [2019-11-26 20:49:12,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:49:12,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:49:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:49:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:49:12,134 INFO L87 Difference]: Start difference. First operand 487 states and 726 transitions. Second operand 3 states. [2019-11-26 20:49:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:12,140 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-11-26 20:49:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:49:12,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 20:49:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:12,146 INFO L225 Difference]: With dead ends: 455 [2019-11-26 20:49:12,146 INFO L226 Difference]: Without dead ends: 455 [2019-11-26 20:49:12,147 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-26 20:49:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-26 20:49:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-26 20:49:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-26 20:49:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 672 transitions. [2019-11-26 20:49:12,163 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 672 transitions. Word has length 23 [2019-11-26 20:49:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:12,163 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 672 transitions. [2019-11-26 20:49:12,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:49:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 672 transitions. [2019-11-26 20:49:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 20:49:12,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:12,165 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-26 20:49:12,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 20:49:12,384 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:12,385 INFO L82 PathProgramCache]: Analyzing trace with hash -494938069, now seen corresponding path program 1 times [2019-11-26 20:49:12,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:12,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026456220] [2019-11-26 20:49:12,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:12,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 20:49:12,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:12,570 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-26 20:49:12,572 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:49:12,596 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-26 20:49:12,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026456220] [2019-11-26 20:49:12,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:49:12,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 20:49:12,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080859650] [2019-11-26 20:49:12,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:49:12,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:49:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:49:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:49:12,599 INFO L87 Difference]: Start difference. First operand 455 states and 672 transitions. Second operand 4 states. [2019-11-26 20:49:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:12,727 INFO L93 Difference]: Finished difference Result 546 states and 769 transitions. [2019-11-26 20:49:12,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:49:12,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 20:49:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:12,731 INFO L225 Difference]: With dead ends: 546 [2019-11-26 20:49:12,731 INFO L226 Difference]: Without dead ends: 546 [2019-11-26 20:49:12,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:49:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-26 20:49:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 515. [2019-11-26 20:49:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-26 20:49:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 752 transitions. [2019-11-26 20:49:12,748 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 752 transitions. Word has length 24 [2019-11-26 20:49:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:12,749 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 752 transitions. [2019-11-26 20:49:12,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:49:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 752 transitions. [2019-11-26 20:49:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 20:49:12,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:12,750 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:49:12,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 20:49:12,963 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-26 20:49:12,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:12,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836538809] [2019-11-26 20:49:12,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:13,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 20:49:13,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:13,143 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-26 20:49:13,143 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:49:13,222 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-26 20:49:13,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836538809] [2019-11-26 20:49:13,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:49:13,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-26 20:49:13,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884495383] [2019-11-26 20:49:13,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:49:13,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:49:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:49:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:49:13,224 INFO L87 Difference]: Start difference. First operand 515 states and 752 transitions. Second operand 8 states. [2019-11-26 20:49:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:13,372 INFO L93 Difference]: Finished difference Result 535 states and 764 transitions. [2019-11-26 20:49:13,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:49:13,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-26 20:49:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:13,376 INFO L225 Difference]: With dead ends: 535 [2019-11-26 20:49:13,376 INFO L226 Difference]: Without dead ends: 535 [2019-11-26 20:49:13,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:49:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-11-26 20:49:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 462. [2019-11-26 20:49:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-26 20:49:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 634 transitions. [2019-11-26 20:49:13,396 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 634 transitions. Word has length 25 [2019-11-26 20:49:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:13,397 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 634 transitions. [2019-11-26 20:49:13,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:49:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 634 transitions. [2019-11-26 20:49:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:49:13,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:13,399 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-26 20:49:13,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 20:49:13,612 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash -71787967, now seen corresponding path program 1 times [2019-11-26 20:49:13,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:13,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328216320] [2019-11-26 20:49:13,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:13,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 20:49:13,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:13,822 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-26 20:49:13,823 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:49:13,858 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-26 20:49:13,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328216320] [2019-11-26 20:49:13,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:49:13,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 20:49:13,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442666615] [2019-11-26 20:49:13,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:49:13,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:49:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:49:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:49:13,860 INFO L87 Difference]: Start difference. First operand 462 states and 634 transitions. Second operand 3 states. [2019-11-26 20:49:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:13,867 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2019-11-26 20:49:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:49:13,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-26 20:49:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:13,869 INFO L225 Difference]: With dead ends: 312 [2019-11-26 20:49:13,870 INFO L226 Difference]: Without dead ends: 312 [2019-11-26 20:49:13,870 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-26 20:49:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-26 20:49:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2019-11-26 20:49:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-26 20:49:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2019-11-26 20:49:13,879 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 33 [2019-11-26 20:49:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:13,880 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2019-11-26 20:49:13,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:49:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2019-11-26 20:49:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:49:13,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:13,882 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-26 20:49:14,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 20:49:14,096 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-26 20:49:14,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:14,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715196428] [2019-11-26 20:49:14,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:14,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 20:49:14,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:14,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:14,558 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-11-26 20:49:14,559 INFO L343 Elim1Store]: treesize reduction 339, result has 15.0 percent of original size [2019-11-26 20:49:14,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-26 20:49:14,560 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:14,649 INFO L588 ElimStorePlain]: treesize reduction 10, result has 87.7 percent of original size [2019-11-26 20:49:14,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:14,651 INFO L508 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-26 20:49:14,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:71 [2019-11-26 20:49:14,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:14,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:14,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:14,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:14,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:49:14,843 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:14,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:14,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:49:14,861 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:14,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:14,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:49:14,879 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:14,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:14,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:49:14,896 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:14,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:14,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:49:14,912 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:14,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:14,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 20:49:14,936 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 20:49:14,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:14,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-26 20:49:14,942 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:15,242 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-26 20:49:15,242 INFO L588 ElimStorePlain]: treesize reduction 88, result has 74.6 percent of original size [2019-11-26 20:49:15,244 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-11-26 20:49:15,244 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:394, output treesize:259 [2019-11-26 20:49:15,336 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 13 treesize of output 9 [2019-11-26 20:49:15,337 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:15,343 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:15,343 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:49:15,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2019-11-26 20:49:15,401 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-26 20:49:15,401 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:49:15,594 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-26 20:49:15,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715196428] [2019-11-26 20:49:15,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:49:15,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-26 20:49:15,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032592162] [2019-11-26 20:49:15,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:49:15,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:49:15,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:49:15,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:49:15,597 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand 11 states. [2019-11-26 20:49:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:49:22,026 INFO L93 Difference]: Finished difference Result 396 states and 499 transitions. [2019-11-26 20:49:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:49:22,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-11-26 20:49:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:49:22,029 INFO L225 Difference]: With dead ends: 396 [2019-11-26 20:49:22,029 INFO L226 Difference]: Without dead ends: 390 [2019-11-26 20:49:22,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:49:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-26 20:49:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 353. [2019-11-26 20:49:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-26 20:49:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 462 transitions. [2019-11-26 20:49:22,039 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 462 transitions. Word has length 33 [2019-11-26 20:49:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:49:22,040 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 462 transitions. [2019-11-26 20:49:22,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:49:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 462 transitions. [2019-11-26 20:49:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 20:49:22,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:49:22,042 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-26 20:49:22,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 20:49:22,242 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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:49:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:49:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1447512898, now seen corresponding path program 1 times [2019-11-26 20:49:22,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:49:22,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281035961] [2019-11-26 20:49:22,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-26 20:49:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:49:22,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-26 20:49:22,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:49:22,836 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:49:22,836 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:49:22,836 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-26 20:49:22,837 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:23,025 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-26 20:49:23,026 INFO L588 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-26 20:49:23,352 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-26 20:49:23,353 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:49:23,353 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-26 20:49:23,354 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:23,580 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-26 20:49:23,581 INFO L588 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-26 20:49:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:23,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,604 INFO L508 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-26 20:49:23,604 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-26 20:49:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:23,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,688 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:49:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:23,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:23,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:23,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:23,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:24,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:24,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,008 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:49:24,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:24,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:24,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:24,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:24,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:24,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,234 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:49:24,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:24,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:49:24,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:49:24,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:24,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:24,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:24,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:49:24,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:24,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:24,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:24,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:24,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:24,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:24,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:24,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:24,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:49:24,720 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:24,721 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-26 20:49:24,722 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:24,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:24,936 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 32 treesize of output 102 [2019-11-26 20:49:24,937 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:25,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:25,110 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 34 treesize of output 104 [2019-11-26 20:49:25,111 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:25,395 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:25,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:25,397 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 41 treesize of output 149 [2019-11-26 20:49:25,398 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:25,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:25,511 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 29 treesize of output 69 [2019-11-26 20:49:25,512 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:25,696 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:49:25,696 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:25,696 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 34 treesize of output 104 [2019-11-26 20:49:25,697 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:25,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:25,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, 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-26 20:49:25,805 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:25,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:25,865 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-26 20:49:25,865 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:25,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:25,971 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 25 treesize of output 65 [2019-11-26 20:49:25,972 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:26,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:26,004 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-26 20:49:26,005 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:26,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:26,117 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 29 treesize of output 69 [2019-11-26 20:49:26,118 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:26,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:26,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-26 20:49:26,200 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:26,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:26,381 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 34 treesize of output 104 [2019-11-26 20:49:26,382 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:26,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:26,551 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 32 treesize of output 102 [2019-11-26 20:49:26,552 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:26,804 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:26,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:26,805 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 39 treesize of output 147 [2019-11-26 20:49:26,807 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:26,977 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:26,978 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 32 treesize of output 102 [2019-11-26 20:49:26,979 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,166 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:49:27,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,167 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 32 treesize of output 102 [2019-11-26 20:49:27,168 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,232 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,232 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 25 treesize of output 41 [2019-11-26 20:49:27,233 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,265 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-26 20:49:27,265 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,299 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-26 20:49:27,299 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,343 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-26 20:49:27,344 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,462 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 20 treesize of output 38 [2019-11-26 20:49:27,463 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,503 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,523 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,611 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 34 treesize of output 72 [2019-11-26 20:49:27,611 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,641 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,652 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 20 treesize of output 22 [2019-11-26 20:49:27,653 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,721 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 20 treesize of output 38 [2019-11-26 20:49:27,722 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,788 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-26 20:49:27,789 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,852 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,853 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 25 treesize of output 41 [2019-11-26 20:49:27,853 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,894 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 20 treesize of output 22 [2019-11-26 20:49:27,894 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:27,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,923 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:27,929 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:27,929 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-26 20:49:27,930 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,199 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:28,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,201 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 41 treesize of output 149 [2019-11-26 20:49:28,202 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,225 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,225 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,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, 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 22 [2019-11-26 20:49:28,236 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 20:49:28,271 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,450 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 34 treesize of output 104 [2019-11-26 20:49:28,451 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,473 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,475 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 15 treesize of output 11 [2019-11-26 20:49:28,475 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,584 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-26 20:49:28,585 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,695 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-26 20:49:28,695 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,820 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 25 treesize of output 65 [2019-11-26 20:49:28,820 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,857 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 18 treesize of output 20 [2019-11-26 20:49:28,857 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 20:49:28,900 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,927 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,936 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:28,967 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-26 20:49:28,968 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:28,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:28,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-26 20:49:29,006 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,183 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 32 treesize of output 102 [2019-11-26 20:49:29,184 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,283 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-26 20:49:29,284 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,459 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 36 treesize of output 106 [2019-11-26 20:49:29,460 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,571 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 25 treesize of output 65 [2019-11-26 20:49:29,572 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,612 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 27 [2019-11-26 20:49:29,613 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,796 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 32 treesize of output 102 [2019-11-26 20:49:29,797 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,865 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-26 20:49:29,866 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,911 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-26 20:49:29,912 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:29,948 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-26 20:49:29,949 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:29,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:29,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,018 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,019 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-26 20:49:30,019 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,057 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,058 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 27 [2019-11-26 20:49:30,058 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,097 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 20 treesize of output 22 [2019-11-26 20:49:30,098 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,126 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 11 [2019-11-26 20:49:30,126 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,152 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,153 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 11 [2019-11-26 20:49:30,153 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,200 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 27 [2019-11-26 20:49:30,200 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,284 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 20 treesize of output 38 [2019-11-26 20:49:30,285 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,355 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 25 treesize of output 41 [2019-11-26 20:49:30,356 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,397 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 20 treesize of output 22 [2019-11-26 20:49:30,398 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,426 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,435 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 20 treesize of output 22 [2019-11-26 20:49:30,436 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,459 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,460 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,461 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,461 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,462 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,470 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 14 [2019-11-26 20:49:30,471 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,511 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,530 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,590 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 4 new quantified variables, introduced 12 case distinctions, treesize of input 39 treesize of output 75 [2019-11-26 20:49:30,590 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,615 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,655 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 32 treesize of output 46 [2019-11-26 20:49:30,655 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 20:49:30,692 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,755 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-26 20:49:30,755 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,807 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 27 [2019-11-26 20:49:30,807 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,866 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 29 treesize of output 24 [2019-11-26 20:49:30,866 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 20:49:30,900 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,950 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 27 [2019-11-26 20:49:30,951 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:30,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,990 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,991 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:30,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:30,998 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 27 [2019-11-26 20:49:30,999 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,028 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 25 treesize of output 14 [2019-11-26 20:49:31,028 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:31,066 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-26 20:49:31,066 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,097 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 15 treesize of output 11 [2019-11-26 20:49:31,097 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,122 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,122 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 29 treesize of output 11 [2019-11-26 20:49:31,123 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,148 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 14 [2019-11-26 20:49:31,148 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:31,221 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 29 treesize of output 45 [2019-11-26 20:49:31,222 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,245 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,248 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,248 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,248 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,249 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 34 treesize of output 14 [2019-11-26 20:49:31,250 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,287 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:31,287 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-26 20:49:31,287 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:31,330 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 20 treesize of output 22 [2019-11-26 20:49:31,331 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:31,367 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-26 20:49:31,367 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,394 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 13 treesize of output 9 [2019-11-26 20:49:31,394 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,418 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,419 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,422 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 11 [2019-11-26 20:49:31,423 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,450 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 20 treesize of output 14 [2019-11-26 20:49:31,450 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,478 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-26 20:49:31,479 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,500 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,500 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:31,538 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-26 20:49:31,539 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,564 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,564 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,587 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,587 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,609 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,609 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,632 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,632 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,653 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,653 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,675 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,676 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,700 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,701 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,724 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,724 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,748 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,748 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,783 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,784 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:31,792 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 27 [2019-11-26 20:49:31,793 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,845 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,845 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,860 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,860 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:31,877 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 20 treesize of output 14 [2019-11-26 20:49:31,878 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,900 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,900 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,916 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,916 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,931 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,931 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,948 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,949 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,963 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,963 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,979 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,979 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:31,995 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:31,995 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,009 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,009 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,025 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,025 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,039 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,040 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,055 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,056 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,072 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,072 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,087 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,087 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,102 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,102 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,117 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,117 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,133 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,133 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,150 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,169 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,169 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 14 [2019-11-26 20:49:32,170 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,186 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,186 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:32,222 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 27 [2019-11-26 20:49:32,223 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,240 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,240 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,255 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,255 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,271 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,272 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,289 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,289 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,302 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,303 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,317 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,318 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:32,347 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-26 20:49:32,348 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,365 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,365 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,380 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,380 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,400 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 25 treesize of output 14 [2019-11-26 20:49:32,400 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,415 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,415 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,435 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 14 [2019-11-26 20:49:32,436 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,449 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,450 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,465 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,466 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,481 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,481 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,496 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,496 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,511 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,512 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,526 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,526 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,541 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,542 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,556 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,556 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,572 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,572 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,587 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,588 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,602 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,603 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,616 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,616 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,630 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,630 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,651 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 14 [2019-11-26 20:49:32,651 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:49:32,673 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 25 treesize of output 14 [2019-11-26 20:49:32,674 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,689 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,689 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,704 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,704 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,718 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,718 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,733 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,733 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,750 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,750 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,764 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,764 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,782 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-26 20:49:32,782 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,797 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,797 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,814 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,814 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,828 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,828 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,843 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,843 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,858 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,858 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,873 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,874 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,888 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,888 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,902 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,902 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,916 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,916 INFO L508 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,930 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,930 INFO L508 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,943 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,944 INFO L508 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,957 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,957 INFO L508 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,970 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,970 INFO L508 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:32,983 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:32,983 INFO L508 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,005 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,005 INFO L508 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,017 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,018 INFO L508 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,031 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,031 INFO L508 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,043 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,044 INFO L508 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,057 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,058 INFO L508 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,073 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,073 INFO L508 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,086 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,086 INFO L508 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,099 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,099 INFO L508 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,112 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,112 INFO L508 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,124 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,124 INFO L508 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,136 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,136 INFO L508 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,147 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:49:33,148 INFO L508 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,394 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-26 20:49:33,395 INFO L588 ElimStorePlain]: treesize reduction 1999, result has 0.8 percent of original size [2019-11-26 20:49:33,398 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-26 20:49:33,399 INFO L508 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,405 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:33,406 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,406 INFO L221 ElimStorePlain]: Needed 181 recursive calls to eliminate 7 variables, input treesize:10867, output treesize:10 [2019-11-26 20:49:33,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:33,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:33,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:49:33,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:49:33,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:33,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:49:33,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:33,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:33,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:33,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:49:33,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:49:33,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:49:33,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:33,742 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 33 treesize of output 92 [2019-11-26 20:49:33,743 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:33,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:33,889 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-26 20:49:34,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,006 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 132 [2019-11-26 20:49:34,008 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:34,154 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,385 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,385 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 35 treesize of output 94 [2019-11-26 20:49:34,386 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:34,501 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:34,567 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,765 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 33 treesize of output 92 [2019-11-26 20:49:34,765 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:34,835 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:34,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:34,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:34,952 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:34,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:35,134 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 33 treesize of output 92 [2019-11-26 20:49:35,135 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:35,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:35,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:35,248 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:35,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:35,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:35,359 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:35,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:35,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:35,473 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:35,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:35,674 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 31 treesize of output 90 [2019-11-26 20:49:35,675 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:35,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,786 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:35,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:35,787 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:35,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,836 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-26 20:49:35,837 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:35,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:35,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:36,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:36,002 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:36,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,249 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:36,250 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 132 [2019-11-26 20:49:36,251 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:36,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,385 INFO L237 Elim1Store]: Index analysis took 103 ms [2019-11-26 20:49:36,516 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:49:36,516 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:36,517 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 132 [2019-11-26 20:49:36,518 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:36,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:36,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:36,628 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:36,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:36,796 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 33 treesize of output 92 [2019-11-26 20:49:36,797 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:36,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:36,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:36,905 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:36,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:36,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:37,073 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 33 treesize of output 92 [2019-11-26 20:49:37,074 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:37,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:37,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:37,214 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:37,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,408 INFO L237 Elim1Store]: Index analysis took 160 ms [2019-11-26 20:49:37,585 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:37,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:37,586 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 45 treesize of output 182 [2019-11-26 20:49:37,588 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:37,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:37,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:37,700 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:37,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:37,882 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 33 treesize of output 92 [2019-11-26 20:49:37,883 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:37,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:37,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,068 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 33 treesize of output 92 [2019-11-26 20:49:38,069 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:38,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:38,186 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:38,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:38,304 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:38,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:38,428 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:38,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:38,498 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:38,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,681 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,682 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 31 treesize of output 90 [2019-11-26 20:49:38,683 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:38,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:38,798 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:38,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:38,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:38,979 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 33 treesize of output 92 [2019-11-26 20:49:38,981 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:39,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:39,098 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:39,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:39,246 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:39,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:39,321 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:39,514 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 33 treesize of output 92 [2019-11-26 20:49:39,515 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:39,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:39,588 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:39,768 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 35 treesize of output 94 [2019-11-26 20:49:39,769 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:39,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:39,903 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:39,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:39,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,098 INFO L237 Elim1Store]: Index analysis took 160 ms [2019-11-26 20:49:40,315 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:40,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:40,317 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 45 treesize of output 182 [2019-11-26 20:49:40,319 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:40,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:40,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:40,451 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:40,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:40,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:40,568 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:40,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:40,755 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 31 treesize of output 90 [2019-11-26 20:49:40,756 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:40,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:40,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:40,940 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 35 treesize of output 94 [2019-11-26 20:49:40,941 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:41,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,136 INFO L237 Elim1Store]: Index analysis took 126 ms [2019-11-26 20:49:41,262 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:49:41,263 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:41,263 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 132 [2019-11-26 20:49:41,264 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:41,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:41,452 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 33 treesize of output 92 [2019-11-26 20:49:41,452 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:41,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,610 INFO L237 Elim1Store]: Index analysis took 119 ms [2019-11-26 20:49:41,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:41,731 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 132 [2019-11-26 20:49:41,732 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:41,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:41,918 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 33 treesize of output 92 [2019-11-26 20:49:41,920 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:41,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:41,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:42,103 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 33 treesize of output 92 [2019-11-26 20:49:42,104 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:42,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:42,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:42,181 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:42,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,339 INFO L237 Elim1Store]: Index analysis took 114 ms [2019-11-26 20:49:42,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:42,461 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 132 [2019-11-26 20:49:42,463 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:42,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,657 INFO L237 Elim1Store]: Index analysis took 155 ms [2019-11-26 20:49:42,785 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:49:42,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:42,786 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 132 [2019-11-26 20:49:42,787 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:42,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,908 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:42,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:42,909 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:42,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:42,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:43,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:43,053 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:43,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,216 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-26 20:49:43,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:43,332 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 40 treesize of output 134 [2019-11-26 20:49:43,334 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:43,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:43,563 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 31 treesize of output 90 [2019-11-26 20:49:43,564 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:43,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:43,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:43,679 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:43,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:43,838 INFO L237 Elim1Store]: Index analysis took 122 ms [2019-11-26 20:49:43,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:43,956 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 40 treesize of output 134 [2019-11-26 20:49:43,957 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:44,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:44,133 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 35 treesize of output 94 [2019-11-26 20:49:44,134 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:44,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:44,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:44,271 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:44,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,416 INFO L237 Elim1Store]: Index analysis took 106 ms [2019-11-26 20:49:44,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:44,546 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 40 treesize of output 134 [2019-11-26 20:49:44,547 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:44,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:44,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:44,667 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:44,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:44,817 INFO L237 Elim1Store]: Index analysis took 114 ms [2019-11-26 20:49:44,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:44,934 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 40 treesize of output 134 [2019-11-26 20:49:44,935 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:44,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,090 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-26 20:49:45,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:45,212 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 132 [2019-11-26 20:49:45,214 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:45,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,422 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:45,423 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 33 treesize of output 92 [2019-11-26 20:49:45,424 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:45,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:45,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:45,545 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:45,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,593 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-26 20:49:45,594 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:45,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:45,794 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 31 treesize of output 90 [2019-11-26 20:49:45,795 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:45,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:45,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:45,913 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:45,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:45,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:45,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:45,989 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:46,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:46,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:46,066 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:46,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:46,256 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 33 treesize of output 92 [2019-11-26 20:49:46,258 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:46,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,415 INFO L237 Elim1Store]: Index analysis took 119 ms [2019-11-26 20:49:46,540 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:46,541 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 132 [2019-11-26 20:49:46,542 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:46,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:46,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:46,628 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:46,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:46,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-26 20:49:46,758 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:46,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:46,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:46,948 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 33 treesize of output 92 [2019-11-26 20:49:46,949 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:47,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:47,137 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 33 treesize of output 92 [2019-11-26 20:49:47,138 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:47,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,331 INFO L237 Elim1Store]: Index analysis took 155 ms [2019-11-26 20:49:47,512 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:47,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:47,513 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 45 treesize of output 182 [2019-11-26 20:49:47,515 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:47,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:47,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:47,602 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:47,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:47,794 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 33 treesize of output 92 [2019-11-26 20:49:47,795 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:47,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:47,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:47,924 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:47,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:47,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:48,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:48,048 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:48,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:48,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:48,125 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:48,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,279 INFO L237 Elim1Store]: Index analysis took 117 ms [2019-11-26 20:49:48,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:48,401 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 132 [2019-11-26 20:49:48,402 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:48,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,620 INFO L237 Elim1Store]: Index analysis took 152 ms [2019-11-26 20:49:48,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:48,742 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 40 treesize of output 134 [2019-11-26 20:49:48,744 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:48,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:48,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:48,870 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:48,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:48,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:48,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:48,991 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:49,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:49,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:49,117 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:49,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:49,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:49,245 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:49,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:49,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-26 20:49:49,372 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:49,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,529 INFO L237 Elim1Store]: Index analysis took 112 ms [2019-11-26 20:49:49,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:49,655 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 132 [2019-11-26 20:49:49,656 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:49,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:49,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:49,747 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:49,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:49,889 INFO L237 Elim1Store]: Index analysis took 104 ms [2019-11-26 20:49:50,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:50,005 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 132 [2019-11-26 20:49:50,006 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:50,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,162 INFO L237 Elim1Store]: Index analysis took 110 ms [2019-11-26 20:49:50,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:50,282 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 40 treesize of output 134 [2019-11-26 20:49:50,283 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:50,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:50,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-26 20:49:50,406 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:50,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:50,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:50,528 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:50,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:50,719 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 33 treesize of output 92 [2019-11-26 20:49:50,720 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:50,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:50,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:50,823 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:50,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:50,992 INFO L237 Elim1Store]: Index analysis took 122 ms [2019-11-26 20:49:51,158 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:49:51,159 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:51,159 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 132 [2019-11-26 20:49:51,161 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:51,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:51,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:51,243 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:51,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:51,423 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 31 treesize of output 90 [2019-11-26 20:49:51,424 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:51,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:51,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:51,546 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:51,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:51,758 INFO L237 Elim1Store]: Index analysis took 177 ms [2019-11-26 20:49:51,940 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:51,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:51,941 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 45 treesize of output 182 [2019-11-26 20:49:51,943 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:51,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:52,136 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 33 treesize of output 92 [2019-11-26 20:49:52,137 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:52,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:52,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:52,253 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:52,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:52,437 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 31 treesize of output 90 [2019-11-26 20:49:52,438 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:52,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:52,630 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 33 treesize of output 92 [2019-11-26 20:49:52,631 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:52,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:52,812 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 35 treesize of output 94 [2019-11-26 20:49:52,813 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:52,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:52,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:52,900 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:52,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:52,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:52,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:52,982 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:53,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:53,161 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 33 treesize of output 92 [2019-11-26 20:49:53,161 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:53,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:53,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:53,254 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:53,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:53,465 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 35 treesize of output 94 [2019-11-26 20:49:53,466 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:53,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:53,657 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 31 treesize of output 90 [2019-11-26 20:49:53,658 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:53,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,797 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:53,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:53,799 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:53,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:53,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:53,927 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:53,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:53,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:54,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:54,048 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:54,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:54,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:54,132 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:54,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:54,320 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 31 treesize of output 90 [2019-11-26 20:49:54,321 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:54,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:54,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:54,452 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:54,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:54,664 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 33 treesize of output 92 [2019-11-26 20:49:54,665 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:54,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,824 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-26 20:49:54,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:54,944 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 40 treesize of output 134 [2019-11-26 20:49:54,945 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:54,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:54,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:55,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:55,023 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:55,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:55,208 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 33 treesize of output 92 [2019-11-26 20:49:55,209 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:55,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:55,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:55,327 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:55,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:55,543 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 33 treesize of output 92 [2019-11-26 20:49:55,544 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:55,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:55,738 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 33 treesize of output 92 [2019-11-26 20:49:55,739 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:55,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:55,927 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 31 treesize of output 90 [2019-11-26 20:49:55,928 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:55,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:55,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:56,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:56,014 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:56,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,075 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-26 20:49:56,076 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:56,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:56,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:49:56,165 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:56,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,337 INFO L237 Elim1Store]: Index analysis took 125 ms [2019-11-26 20:49:56,473 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:49:56,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:56,474 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 132 [2019-11-26 20:49:56,476 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:56,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:56,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:56,611 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:56,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:56,840 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 33 treesize of output 92 [2019-11-26 20:49:56,841 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:56,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:56,986 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:56,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:56,987 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:57,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:57,189 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 31 treesize of output 90 [2019-11-26 20:49:57,191 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:57,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:57,397 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 33 treesize of output 92 [2019-11-26 20:49:57,399 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:57,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:57,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:57,529 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:57,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:57,735 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 33 treesize of output 92 [2019-11-26 20:49:57,736 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:57,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:57,902 INFO L237 Elim1Store]: Index analysis took 122 ms [2019-11-26 20:49:58,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:58,037 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 132 [2019-11-26 20:49:58,039 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:58,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:58,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-26 20:49:58,177 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:58,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,331 INFO L237 Elim1Store]: Index analysis took 103 ms [2019-11-26 20:49:58,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:58,411 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 31 treesize of output 90 [2019-11-26 20:49:58,412 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:58,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,639 INFO L237 Elim1Store]: Index analysis took 178 ms [2019-11-26 20:49:58,829 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:49:58,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:58,830 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 45 treesize of output 182 [2019-11-26 20:49:58,833 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:58,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:58,994 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-11-26 20:49:59,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:59,067 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 33 treesize of output 92 [2019-11-26 20:49:59,068 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:59,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:59,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:59,201 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:59,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,346 INFO L237 Elim1Store]: Index analysis took 107 ms [2019-11-26 20:49:59,454 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:59,455 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 40 treesize of output 134 [2019-11-26 20:49:59,457 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:59,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:59,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:49:59,599 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:59,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:59,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:49:59,689 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:59,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:59,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:59,810 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:49:59,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:49:59,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:49:59,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-26 20:49:59,970 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:00,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,131 INFO L237 Elim1Store]: Index analysis took 119 ms [2019-11-26 20:50:00,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:00,240 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 132 [2019-11-26 20:50:00,241 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:00,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,402 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-26 20:50:00,518 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:00,518 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 132 [2019-11-26 20:50:00,519 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:00,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:00,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:50:00,649 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:00,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:00,806 INFO L237 Elim1Store]: Index analysis took 116 ms [2019-11-26 20:50:00,939 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:50:00,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:00,941 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 40 treesize of output 134 [2019-11-26 20:50:00,942 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:01,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,145 INFO L237 Elim1Store]: Index analysis took 159 ms [2019-11-26 20:50:01,337 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:50:01,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:01,338 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 45 treesize of output 182 [2019-11-26 20:50:01,340 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:01,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,526 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:01,526 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 31 treesize of output 90 [2019-11-26 20:50:01,528 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:01,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,584 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-26 20:50:01,585 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:01,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:01,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:50:01,673 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:01,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:01,846 INFO L237 Elim1Store]: Index analysis took 129 ms [2019-11-26 20:50:01,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:01,978 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 40 treesize of output 134 [2019-11-26 20:50:01,979 INFO L508 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:02,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:02,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:50:02,062 INFO L508 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:02,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,277 INFO L237 Elim1Store]: Index analysis took 169 ms [2019-11-26 20:50:02,494 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:50:02,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:02,495 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 45 treesize of output 182 [2019-11-26 20:50:02,498 INFO L508 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:02,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:02,701 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 33 treesize of output 92 [2019-11-26 20:50:02,702 INFO L508 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:02,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:02,879 INFO L237 Elim1Store]: Index analysis took 129 ms [2019-11-26 20:50:03,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:03,006 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 132 [2019-11-26 20:50:03,007 INFO L508 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:03,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,166 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-11-26 20:50:03,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:03,298 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 40 treesize of output 134 [2019-11-26 20:50:03,300 INFO L508 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:03,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,480 INFO L237 Elim1Store]: Index analysis took 136 ms [2019-11-26 20:50:03,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:03,589 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 40 treesize of output 134 [2019-11-26 20:50:03,590 INFO L508 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:03,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:03,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:50:03,726 INFO L508 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:03,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:03,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-26 20:50:03,864 INFO L508 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:03,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:03,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,022 INFO L237 Elim1Store]: Index analysis took 112 ms [2019-11-26 20:50:04,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:04,133 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 132 [2019-11-26 20:50:04,134 INFO L508 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:04,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:04,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:50:04,262 INFO L508 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:04,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,470 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:04,471 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 31 treesize of output 90 [2019-11-26 20:50:04,472 INFO L508 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:04,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:04,671 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 33 treesize of output 92 [2019-11-26 20:50:04,672 INFO L508 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:04,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,884 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:04,885 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 31 treesize of output 90 [2019-11-26 20:50:04,886 INFO L508 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:04,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:04,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:04,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:50:04,971 INFO L508 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:05,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:05,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-26 20:50:05,096 INFO L508 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:05,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,182 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:05,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-26 20:50:05,184 INFO L508 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:05,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:05,400 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 33 treesize of output 92 [2019-11-26 20:50:05,400 INFO L508 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:05,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:05,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:50:05,489 INFO L508 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:05,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,558 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-26 20:50:05,559 INFO L508 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:05,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:05,771 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 33 treesize of output 92 [2019-11-26 20:50:05,772 INFO L508 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:05,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:05,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:05,966 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 33 treesize of output 92 [2019-11-26 20:50:05,967 INFO L508 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:06,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,131 INFO L237 Elim1Store]: Index analysis took 114 ms [2019-11-26 20:50:06,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:06,216 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 31 treesize of output 90 [2019-11-26 20:50:06,216 INFO L508 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:06,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:06,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-26 20:50:06,317 INFO L508 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:06,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:06,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-26 20:50:06,452 INFO L508 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:06,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:06,642 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 33 treesize of output 92 [2019-11-26 20:50:06,643 INFO L508 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:06,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:06,846 INFO L237 Elim1Store]: Index analysis took 154 ms [2019-11-26 20:50:06,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:06,975 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 40 treesize of output 134 [2019-11-26 20:50:06,977 INFO L508 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:07,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:07,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-26 20:50:07,097 INFO L508 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:07,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:07,280 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 31 treesize of output 90 [2019-11-26 20:50:07,282 INFO L508 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:07,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:07,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:07,424 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 31 treesize of output 90 [2019-11-26 20:50:07,425 INFO L508 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:10,269 WARN L192 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 397 DAG size of output: 32 [2019-11-26 20:50:10,270 INFO L588 ElimStorePlain]: treesize reduction 21410, result has 0.5 percent of original size [2019-11-26 20:50:10,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:10,278 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 13 treesize of output 9 [2019-11-26 20:50:10,278 INFO L508 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:10,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:10,286 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 13 treesize of output 9 [2019-11-26 20:50:10,287 INFO L508 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:10,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:10,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:10,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:10,302 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 18 treesize of output 20 [2019-11-26 20:50:10,302 INFO L508 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:10,331 INFO L588 ElimStorePlain]: treesize reduction 43, result has 27.1 percent of original size [2019-11-26 20:50:10,332 INFO L508 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-26 20:50:10,332 INFO L221 ElimStorePlain]: Needed 195 recursive calls to eliminate 8 variables, input treesize:13986, output treesize:16 [2019-11-26 20:50:10,405 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-26 20:50:10,405 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:50:10,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:11,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:11,013 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:50:11,337 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-26 20:50:11,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:11,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:50:11,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:50:11,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-26 20:50:11,368 INFO L404 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_3|], 6=[|v_old(#valid)_BEFORE_CALL_3|]} [2019-11-26 20:50:11,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 20:50:11,581 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:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) 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.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-26 20:50:11,587 INFO L168 Benchmark]: Toolchain (without parser) took 101775.39 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 486.5 MB). Free memory was 956.3 MB in the beginning and 1.5 GB in the end (delta: -498.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:50:11,587 INFO L168 Benchmark]: CDTParser took 1.44 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-26 20:50:11,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-26 20:50:11,587 INFO L168 Benchmark]: Boogie Preprocessor took 87.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:50:11,588 INFO L168 Benchmark]: RCFGBuilder took 797.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. [2019-11-26 20:50:11,588 INFO L168 Benchmark]: TraceAbstraction took 100178.29 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -446.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:50:11,589 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 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 707.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 797.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100178.29 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -446.4 MB). There was no memory consumed. 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:283) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...