./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 20:42:28,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:42:28,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:42:28,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:42:28,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:42:28,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:42:28,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:42:28,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:42:28,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:42:28,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:42:28,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:42:28,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:42:28,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:42:28,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:42:28,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:42:28,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:42:28,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:42:28,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:42:28,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:42:28,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:42:28,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:42:28,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:42:28,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:42:28,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:42:28,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:42:28,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:42:28,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:42:28,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:42:28,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:42:28,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:42:28,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:42:28,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:42:28,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:42:28,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:42:28,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:42:28,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:42:28,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:42:28,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:42:28,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:42:28,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:42:28,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:42:28,137 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:28,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:42:28,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:42:28,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:42:28,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:42:28,168 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:42:28,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:42:28,168 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 20:42:28,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:42:28,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:42:28,169 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 20:42:28,169 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 20:42:28,170 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 20:42:28,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:42:28,170 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 20:42:28,170 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:42:28,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:42:28,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:42:28,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:42:28,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:42:28,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:42:28,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:42:28,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:42:28,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 20:42:28,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 20:42:28,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-26 20:42:28,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:42:28,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:42:28,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:42:28,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:42:28,497 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:42:28,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-26 20:42:28,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf67cdee0/90c8df928b6c4108b172e5a87037ceca/FLAGddf703439 [2019-11-26 20:42:29,134 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:42:29,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-26 20:42:29,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf67cdee0/90c8df928b6c4108b172e5a87037ceca/FLAGddf703439 [2019-11-26 20:42:29,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf67cdee0/90c8df928b6c4108b172e5a87037ceca [2019-11-26 20:42:29,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:42:29,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 20:42:29,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:42:29,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:42:29,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:42:29,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:42:29" (1/1) ... [2019-11-26 20:42:29,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5399f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:29, skipping insertion in model container [2019-11-26 20:42:29,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:42:29" (1/1) ... [2019-11-26 20:42:29,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:42:29,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:42:29,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:42:29,970 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 20:42:30,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:42:30,137 INFO L208 MainTranslator]: Completed translation [2019-11-26 20:42:30,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:30 WrapperNode [2019-11-26 20:42:30,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:42:30,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 20:42:30,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 20:42:30,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 20:42:30,152 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:30" (1/1) ... [2019-11-26 20:42:30,153 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:30" (1/1) ... [2019-11-26 20:42:30,187 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:30" (1/1) ... [2019-11-26 20:42:30,187 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:30" (1/1) ... [2019-11-26 20:42:30,211 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:30" (1/1) ... [2019-11-26 20:42:30,215 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:30" (1/1) ... [2019-11-26 20:42:30,220 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:30" (1/1) ... [2019-11-26 20:42:30,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 20:42:30,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 20:42:30,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 20:42:30,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 20:42:30,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42: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:42:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 20:42:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 20:42:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-26 20:42:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 20:42:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 20:42:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-26 20:42:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-26 20:42:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-26 20:42:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 20:42:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 20:42:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 20:42:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 20:42:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 20:42:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 20:42:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 20:42:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 20:42:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 20:42:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 20:42:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 20:42:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 20:42:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 20:42:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 20:42:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 20:42:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 20:42:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 20:42:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 20:42:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 20:42:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 20:42:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 20:42:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 20:42:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 20:42:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 20:42:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 20:42:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 20:42:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 20:42:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 20:42:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 20:42:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 20:42:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 20:42:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 20:42:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 20:42:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 20:42:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 20:42:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 20:42:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 20:42:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 20:42:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 20:42:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 20:42:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 20:42:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 20:42:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 20:42:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 20:42:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 20:42:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 20:42:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 20:42:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 20:42:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 20:42:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 20:42:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 20:42:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 20:42:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 20:42:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 20:42:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 20:42:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 20:42:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 20:42:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 20:42:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 20:42:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 20:42:30,302 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 20:42:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 20:42:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 20:42:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 20:42:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 20:42:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 20:42:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 20:42:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 20:42:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 20:42:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 20:42:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 20:42:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 20:42:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 20:42:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 20:42:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 20:42:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 20:42:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 20:42:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 20:42:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 20:42:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-26 20:42:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-26 20:42:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-26 20:42:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-26 20:42:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-26 20:42:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-26 20:42:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-26 20:42:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-26 20:42:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-26 20:42:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-26 20:42:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-26 20:42:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-26 20:42:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-26 20:42:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-26 20:42:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-26 20:42:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-26 20:42:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-26 20:42:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-26 20:42:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-26 20:42:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-26 20:42:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-26 20:42:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-26 20:42:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-26 20:42:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-26 20:42:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-26 20:42:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-26 20:42:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-26 20:42:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-26 20:42:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-26 20:42:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-26 20:42:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-26 20:42:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-26 20:42:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-26 20:42:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-26 20:42:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-26 20:42:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-26 20:42:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-26 20:42:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-26 20:42:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 20:42:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 20:42:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 20:42:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 20:42:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 20:42:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 20:42:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 20:42:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 20:42:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 20:42:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 20:42:31,031 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 20:42:31,032 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 20:42:31,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:42:31 BoogieIcfgContainer [2019-11-26 20:42:31,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 20:42:31,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 20:42:31,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 20:42:31,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 20:42:31,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 08:42:29" (1/3) ... [2019-11-26 20:42:31,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b63331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:42:31, skipping insertion in model container [2019-11-26 20:42:31,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:42:30" (2/3) ... [2019-11-26 20:42:31,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b63331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:42:31, skipping insertion in model container [2019-11-26 20:42:31,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:42:31" (3/3) ... [2019-11-26 20:42:31,042 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-26 20:42:31,052 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 20:42:31,059 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-26 20:42:31,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-26 20:42:31,087 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 20:42:31,087 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 20:42:31,087 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 20:42:31,087 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 20:42:31,087 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 20:42:31,088 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 20:42:31,088 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 20:42:31,088 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 20:42:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-26 20:42:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:42:31,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:31,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:31,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989328, now seen corresponding path program 1 times [2019-11-26 20:42:31,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:31,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928427959] [2019-11-26 20:42:31,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:31,564 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:31,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928427959] [2019-11-26 20:42:31,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:31,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 20:42:31,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100615989] [2019-11-26 20:42:31,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:42:31,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:31,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:42:31,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:42:31,596 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-26 20:42:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:32,124 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-11-26 20:42:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:42:32,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 20:42:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:32,139 INFO L225 Difference]: With dead ends: 105 [2019-11-26 20:42:32,139 INFO L226 Difference]: Without dead ends: 96 [2019-11-26 20:42:32,141 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:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-26 20:42:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-11-26 20:42:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-26 20:42:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2019-11-26 20:42:32,215 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 9 [2019-11-26 20:42:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:32,216 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2019-11-26 20:42:32,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:42:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2019-11-26 20:42:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:42:32,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:32,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:32,218 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989329, now seen corresponding path program 1 times [2019-11-26 20:42:32,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:32,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229074305] [2019-11-26 20:42:32,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:32,509 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:32,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229074305] [2019-11-26 20:42:32,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:32,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:42:32,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232517782] [2019-11-26 20:42:32,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:42:32,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:42:32,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:42:32,517 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand 6 states. [2019-11-26 20:42:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:33,398 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2019-11-26 20:42:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:42:33,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-26 20:42:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:33,402 INFO L225 Difference]: With dead ends: 176 [2019-11-26 20:42:33,402 INFO L226 Difference]: Without dead ends: 176 [2019-11-26 20:42:33,403 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:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-26 20:42:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2019-11-26 20:42:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 20:42:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2019-11-26 20:42:33,437 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 9 [2019-11-26 20:42:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:33,438 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2019-11-26 20:42:33,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:42:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2019-11-26 20:42:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 20:42:33,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:33,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:33,439 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1859028932, now seen corresponding path program 1 times [2019-11-26 20:42:33,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:33,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623034160] [2019-11-26 20:42:33,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:33,778 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:33,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623034160] [2019-11-26 20:42:33,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:33,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:42:33,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915906244] [2019-11-26 20:42:33,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:42:33,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:42:33,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:42:33,781 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand 6 states. [2019-11-26 20:42:34,003 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-26 20:42:34,142 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-26 20:42:34,340 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-26 20:42:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:35,066 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-11-26 20:42:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:42:35,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-26 20:42:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:35,070 INFO L225 Difference]: With dead ends: 270 [2019-11-26 20:42:35,071 INFO L226 Difference]: Without dead ends: 270 [2019-11-26 20:42:35,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:42:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-26 20:42:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 219. [2019-11-26 20:42:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-26 20:42:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2019-11-26 20:42:35,101 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 10 [2019-11-26 20:42:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:35,101 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2019-11-26 20:42:35,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:42:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2019-11-26 20:42:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 20:42:35,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:35,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:35,102 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:35,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1795322128, now seen corresponding path program 1 times [2019-11-26 20:42:35,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:35,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774934237] [2019-11-26 20:42:35,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:35,442 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:35,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774934237] [2019-11-26 20:42:35,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:35,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:42:35,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029691409] [2019-11-26 20:42:35,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:42:35,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:42:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:42:35,446 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand 6 states. [2019-11-26 20:42:35,699 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-26 20:42:35,899 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-11-26 20:42:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:36,682 INFO L93 Difference]: Finished difference Result 256 states and 361 transitions. [2019-11-26 20:42:36,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 20:42:36,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-26 20:42:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:36,690 INFO L225 Difference]: With dead ends: 256 [2019-11-26 20:42:36,690 INFO L226 Difference]: Without dead ends: 256 [2019-11-26 20:42:36,691 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:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-26 20:42:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2019-11-26 20:42:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-26 20:42:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 322 transitions. [2019-11-26 20:42:36,714 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 322 transitions. Word has length 11 [2019-11-26 20:42:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:36,714 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 322 transitions. [2019-11-26 20:42:36,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:42:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 322 transitions. [2019-11-26 20:42:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 20:42:36,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:36,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:36,715 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:36,716 INFO L82 PathProgramCache]: Analyzing trace with hash -179588794, now seen corresponding path program 1 times [2019-11-26 20:42:36,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:36,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220425689] [2019-11-26 20:42:36,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:36,842 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:36,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220425689] [2019-11-26 20:42:36,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:36,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:42:36,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12513650] [2019-11-26 20:42:36,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:42:36,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:42:36,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:42:36,845 INFO L87 Difference]: Start difference. First operand 219 states and 322 transitions. Second operand 7 states. [2019-11-26 20:42:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:37,809 INFO L93 Difference]: Finished difference Result 290 states and 395 transitions. [2019-11-26 20:42:37,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:42:37,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-26 20:42:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:37,813 INFO L225 Difference]: With dead ends: 290 [2019-11-26 20:42:37,813 INFO L226 Difference]: Without dead ends: 290 [2019-11-26 20:42:37,814 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:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-26 20:42:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 254. [2019-11-26 20:42:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-26 20:42:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-26 20:42:37,836 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 12 [2019-11-26 20:42:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:37,836 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-26 20:42:37,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:42:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-26 20:42:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 20:42:37,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:37,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:42:37,838 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1272285230, now seen corresponding path program 1 times [2019-11-26 20:42:37,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:37,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162937534] [2019-11-26 20:42:37,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:38,066 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:38,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162937534] [2019-11-26 20:42:38,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:42:38,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:42:38,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457682492] [2019-11-26 20:42:38,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:42:38,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:42:38,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:42:38,068 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 7 states. [2019-11-26 20:42:38,309 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-26 20:42:38,509 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-26 20:42:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:39,257 INFO L93 Difference]: Finished difference Result 280 states and 383 transitions. [2019-11-26 20:42:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:42:39,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-26 20:42:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:39,262 INFO L225 Difference]: With dead ends: 280 [2019-11-26 20:42:39,262 INFO L226 Difference]: Without dead ends: 280 [2019-11-26 20:42:39,262 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:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-26 20:42:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 254. [2019-11-26 20:42:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-26 20:42:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-26 20:42:39,279 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 13 [2019-11-26 20:42:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:39,279 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-26 20:42:39,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:42:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-26 20:42:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 20:42:39,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:39,280 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:39,281 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash 668439832, now seen corresponding path program 1 times [2019-11-26 20:42:39,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:39,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568173680] [2019-11-26 20:42:39,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:39,415 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:39,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568173680] [2019-11-26 20:42:39,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294672251] [2019-11-26 20:42:39,417 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:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:39,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 20:42:39,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:42:39,826 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:42:39,830 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:42:39,831 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:39,832 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:39,931 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-26 20:42:39,934 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:39,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-26 20:42:39,976 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:39,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:42:39,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-11-26 20:42:39,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253430232] [2019-11-26 20:42:39,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:42:39,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:39,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:42:39,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:42:39,979 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 10 states. [2019-11-26 20:42:40,436 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-26 20:42:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:40,982 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2019-11-26 20:42:40,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:42:40,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 20:42:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:40,985 INFO L225 Difference]: With dead ends: 301 [2019-11-26 20:42:40,985 INFO L226 Difference]: Without dead ends: 301 [2019-11-26 20:42:40,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:42:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-26 20:42:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 257. [2019-11-26 20:42:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-26 20:42:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 367 transitions. [2019-11-26 20:42:41,012 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 367 transitions. Word has length 17 [2019-11-26 20:42:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:41,013 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 367 transitions. [2019-11-26 20:42:41,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:42:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 367 transitions. [2019-11-26 20:42:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 20:42:41,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:41,015 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:41,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:42:41,219 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:41,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash -753201699, now seen corresponding path program 1 times [2019-11-26 20:42:41,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:41,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917457094] [2019-11-26 20:42:41,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:41,567 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:41,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917457094] [2019-11-26 20:42:41,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089163506] [2019-11-26 20:42:41,568 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:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:41,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 20:42:41,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:42:42,132 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-26 20:42:42,133 INFO L343 Elim1Store]: treesize reduction 487, result has 22.1 percent of original size [2019-11-26 20:42:42,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, 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:42,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:42,438 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:42,896 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 61 [2019-11-26 20:42:42,898 INFO L588 ElimStorePlain]: treesize reduction 12278, result has 1.1 percent of original size [2019-11-26 20:42:42,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:42,907 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:42,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:120, output treesize:134 [2019-11-26 20:42:42,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:42,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:43,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:43,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:43,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:43,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:42:43,822 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-26 20:42:46,765 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 123 [2019-11-26 20:42:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:42:46,801 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:46,802 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:46,934 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-26 20:42:46,935 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:46,942 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:46,943 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:47,077 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-26 20:42:47,077 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:47,082 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:47,084 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:47,245 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-26 20:42:47,245 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:47,247 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:47,248 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:307, output treesize:222 [2019-11-26 20:42:47,445 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-26 20:42:47,456 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:47,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:42:47,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2019-11-26 20:42:47,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694667615] [2019-11-26 20:42:47,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 20:42:47,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:47,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 20:42:47,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:42:47,458 INFO L87 Difference]: Start difference. First operand 257 states and 367 transitions. Second operand 15 states. [2019-11-26 20:42:49,506 WARN L192 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-26 20:42:50,072 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 178 [2019-11-26 20:42:50,370 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-26 20:42:51,165 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 178 [2019-11-26 20:42:51,642 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-26 20:42:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:42:53,883 INFO L93 Difference]: Finished difference Result 320 states and 444 transitions. [2019-11-26 20:42:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 20:42:53,885 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-26 20:42:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:42:53,887 INFO L225 Difference]: With dead ends: 320 [2019-11-26 20:42:53,887 INFO L226 Difference]: Without dead ends: 320 [2019-11-26 20:42:53,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:42:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-26 20:42:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-11-26 20:42:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-26 20:42:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 374 transitions. [2019-11-26 20:42:53,917 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 374 transitions. Word has length 18 [2019-11-26 20:42:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:42:53,918 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 374 transitions. [2019-11-26 20:42:53,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 20:42:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 374 transitions. [2019-11-26 20:42:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 20:42:53,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:42:53,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:42:54,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:42:54,133 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:42:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:42:54,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1874416105, now seen corresponding path program 1 times [2019-11-26 20:42:54,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:42:54,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540330137] [2019-11-26 20:42:54,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:42:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:54,595 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:42:54,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540330137] [2019-11-26 20:42:54,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712531003] [2019-11-26 20:42:54,595 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:42:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:42:54,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 20:42:54,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:42:54,740 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_35|], 23=[|v_#valid_49|]} [2019-11-26 20:42:54,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,789 INFO L343 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2019-11-26 20:42:54,790 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:42:54,790 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:54,837 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:54,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:42:54,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:54,903 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:42:54,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:42:54,920 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:55,271 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:42:55,272 INFO L588 ElimStorePlain]: treesize reduction 1486, result has 6.2 percent of original size [2019-11-26 20:42:55,273 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:42:55,273 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:135, output treesize:99 [2019-11-26 20:42:55,529 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:42:55,530 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:55,563 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:55,567 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:42:55,568 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:42:55,597 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:42:55,599 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:42:55,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:66 [2019-11-26 20:42:55,668 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:42:55,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:42:55,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-11-26 20:42:55,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219732920] [2019-11-26 20:42:55,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:42:55,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:42:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:42:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:42:55,670 INFO L87 Difference]: Start difference. First operand 263 states and 374 transitions. Second operand 14 states. [2019-11-26 20:42:55,840 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-26 20:42:56,045 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-11-26 20:42:56,273 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-26 20:42:56,595 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-26 20:42:57,171 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-11-26 20:42:57,590 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-26 20:42:58,148 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-26 20:42:58,606 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-26 20:42:59,058 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-11-26 20:42:59,443 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-11-26 20:43:00,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:00,354 INFO L93 Difference]: Finished difference Result 310 states and 433 transitions. [2019-11-26 20:43:00,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 20:43:00,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-26 20:43:00,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:00,357 INFO L225 Difference]: With dead ends: 310 [2019-11-26 20:43:00,357 INFO L226 Difference]: Without dead ends: 310 [2019-11-26 20:43:00,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-11-26 20:43:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-26 20:43:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-26 20:43:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-26 20:43:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 371 transitions. [2019-11-26 20:43:00,374 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 371 transitions. Word has length 19 [2019-11-26 20:43:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:00,374 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 371 transitions. [2019-11-26 20:43:00,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:43:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 371 transitions. [2019-11-26 20:43:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 20:43:00,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:00,376 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:00,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:43:00,588 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash 550421903, now seen corresponding path program 1 times [2019-11-26 20:43:00,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:00,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382858271] [2019-11-26 20:43:00,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:00,675 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:00,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382858271] [2019-11-26 20:43:00,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:00,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 20:43:00,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29576369] [2019-11-26 20:43:00,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:00,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:00,678 INFO L87 Difference]: Start difference. First operand 263 states and 371 transitions. Second operand 4 states. [2019-11-26 20:43:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:00,959 INFO L93 Difference]: Finished difference Result 262 states and 369 transitions. [2019-11-26 20:43:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:43:00,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-26 20:43:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:00,962 INFO L225 Difference]: With dead ends: 262 [2019-11-26 20:43:00,962 INFO L226 Difference]: Without dead ends: 262 [2019-11-26 20:43:00,962 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:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-26 20:43:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-11-26 20:43:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-26 20:43:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-11-26 20:43:00,974 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 23 [2019-11-26 20:43:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:00,975 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-11-26 20:43:00,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-11-26 20:43:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 20:43:00,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:00,976 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:00,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash -116790132, now seen corresponding path program 1 times [2019-11-26 20:43:00,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:00,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580346947] [2019-11-26 20:43:00,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:01,080 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:01,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580346947] [2019-11-26 20:43:01,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:01,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:43:01,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860198699] [2019-11-26 20:43:01,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:01,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:01,084 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 4 states. [2019-11-26 20:43:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:01,320 INFO L93 Difference]: Finished difference Result 195 states and 262 transitions. [2019-11-26 20:43:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:43:01,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 20:43:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:01,322 INFO L225 Difference]: With dead ends: 195 [2019-11-26 20:43:01,322 INFO L226 Difference]: Without dead ends: 195 [2019-11-26 20:43:01,322 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:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-26 20:43:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2019-11-26 20:43:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-26 20:43:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-11-26 20:43:01,330 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 24 [2019-11-26 20:43:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:01,331 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-11-26 20:43:01,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-11-26 20:43:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 20:43:01,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:01,335 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:01,335 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash -29640501, now seen corresponding path program 1 times [2019-11-26 20:43:01,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:01,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84225970] [2019-11-26 20:43:01,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:01,429 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:01,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84225970] [2019-11-26 20:43:01,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:01,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 20:43:01,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486353326] [2019-11-26 20:43:01,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:01,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:01,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:01,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:01,431 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 4 states. [2019-11-26 20:43:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:01,779 INFO L93 Difference]: Finished difference Result 253 states and 346 transitions. [2019-11-26 20:43:01,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:43:01,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 20:43:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:01,782 INFO L225 Difference]: With dead ends: 253 [2019-11-26 20:43:01,782 INFO L226 Difference]: Without dead ends: 253 [2019-11-26 20:43:01,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:43:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-26 20:43:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 239. [2019-11-26 20:43:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-26 20:43:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 337 transitions. [2019-11-26 20:43:01,799 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 337 transitions. Word has length 24 [2019-11-26 20:43:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:01,801 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 337 transitions. [2019-11-26 20:43:01,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 337 transitions. [2019-11-26 20:43:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 20:43:01,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:01,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:43:01,807 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:01,808 INFO L82 PathProgramCache]: Analyzing trace with hash -918855488, now seen corresponding path program 1 times [2019-11-26 20:43:01,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:01,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616150590] [2019-11-26 20:43:01,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:01,948 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:01,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616150590] [2019-11-26 20:43:01,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:01,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 20:43:01,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379706430] [2019-11-26 20:43:01,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:43:01,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:01,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:43:01,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:43:01,955 INFO L87 Difference]: Start difference. First operand 239 states and 337 transitions. Second operand 4 states. [2019-11-26 20:43:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:02,360 INFO L93 Difference]: Finished difference Result 257 states and 350 transitions. [2019-11-26 20:43:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:43:02,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-26 20:43:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:02,363 INFO L225 Difference]: With dead ends: 257 [2019-11-26 20:43:02,363 INFO L226 Difference]: Without dead ends: 257 [2019-11-26 20:43:02,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:43:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-26 20:43:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2019-11-26 20:43:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-26 20:43:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 339 transitions. [2019-11-26 20:43:02,374 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 339 transitions. Word has length 25 [2019-11-26 20:43:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:02,374 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 339 transitions. [2019-11-26 20:43:02,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:43:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 339 transitions. [2019-11-26 20:43:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:43:02,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:02,380 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:02,380 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:02,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2138371761, now seen corresponding path program 1 times [2019-11-26 20:43:02,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:02,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228963029] [2019-11-26 20:43:02,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,495 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:02,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228963029] [2019-11-26 20:43:02,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:43:02,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:43:02,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009723906] [2019-11-26 20:43:02,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:43:02,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:02,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:43:02,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:43:02,497 INFO L87 Difference]: Start difference. First operand 241 states and 339 transitions. Second operand 5 states. [2019-11-26 20:43:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:02,707 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2019-11-26 20:43:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:43:02,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-26 20:43:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:02,710 INFO L225 Difference]: With dead ends: 202 [2019-11-26 20:43:02,710 INFO L226 Difference]: Without dead ends: 202 [2019-11-26 20:43:02,711 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:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-26 20:43:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2019-11-26 20:43:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-26 20:43:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 263 transitions. [2019-11-26 20:43:02,719 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 263 transitions. Word has length 33 [2019-11-26 20:43:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:02,719 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 263 transitions. [2019-11-26 20:43:02,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:43:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 263 transitions. [2019-11-26 20:43:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:43:02,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:02,720 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:02,721 INFO L410 AbstractCegarLoop]: === Iteration 15 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash -138461554, now seen corresponding path program 1 times [2019-11-26 20:43:02,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:02,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955454133] [2019-11-26 20:43:02,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:02,905 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:02,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955454133] [2019-11-26 20:43:02,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184534952] [2019-11-26 20:43:02,906 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:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:03,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-26 20:43:03,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:43:03,331 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2019-11-26 20:43:03,332 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-26 20:43:03,333 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:03,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:03,359 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:03,604 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-11-26 20:43:03,604 INFO L588 ElimStorePlain]: treesize reduction 1301, result has 6.8 percent of original size [2019-11-26 20:43:03,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:03,609 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:03,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:95 [2019-11-26 20:43:03,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:03,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:04,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:04,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:04,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:04,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:04,925 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:04,926 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:04,936 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:04,936 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:04,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:04,993 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:04,995 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:05,054 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:05,055 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:05,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:05,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:05,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:05,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:05,157 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:05,158 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:05,223 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:05,224 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:05,258 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:05,259 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:05,527 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-26 20:43:05,528 INFO L588 ElimStorePlain]: treesize reduction 52, result has 81.0 percent of original size [2019-11-26 20:43:05,529 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:05,529 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:527, output treesize:12 [2019-11-26 20:43:05,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:05,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:06,060 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-26 20:43:06,180 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:06,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:43:06,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-26 20:43:06,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887377667] [2019-11-26 20:43:06,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:43:06,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:43:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:43:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:43:06,182 INFO L87 Difference]: Start difference. First operand 197 states and 263 transitions. Second operand 12 states. [2019-11-26 20:43:07,735 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-11-26 20:43:14,027 WARN L192 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-26 20:43:28,946 WARN L192 SmtUtils]: Spent 14.82 s on a formula simplification. DAG size of input: 167 DAG size of output: 109 [2019-11-26 20:43:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:43:49,579 INFO L93 Difference]: Finished difference Result 279 states and 357 transitions. [2019-11-26 20:43:49,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:43:49,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-26 20:43:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:43:49,583 INFO L225 Difference]: With dead ends: 279 [2019-11-26 20:43:49,583 INFO L226 Difference]: Without dead ends: 279 [2019-11-26 20:43:49,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:43:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-26 20:43:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 245. [2019-11-26 20:43:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-26 20:43:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 333 transitions. [2019-11-26 20:43:49,600 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 333 transitions. Word has length 33 [2019-11-26 20:43:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:43:49,600 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 333 transitions. [2019-11-26 20:43:49,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:43:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 333 transitions. [2019-11-26 20:43:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 20:43:49,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:43:49,603 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:49,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:43:49,815 INFO L410 AbstractCegarLoop]: === Iteration 16 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:43:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:43:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash -615136466, now seen corresponding path program 1 times [2019-11-26 20:43:49,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:43:49,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892846952] [2019-11-26 20:43:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:43:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:50,165 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:50,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892846952] [2019-11-26 20:43:50,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524228041] [2019-11-26 20:43:50,166 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:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:43:50,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-26 20:43:50,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:43:50,555 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:43:50,555 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:43:50,556 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:50,556 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,668 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-26 20:43:50,668 INFO L588 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-26 20:43:50,868 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:43:50,869 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:43:50,869 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:50,870 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:50,993 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-26 20:43:50,994 INFO L588 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-26 20:43:50,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:50,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:50,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:50,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:50,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:50,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:50,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:50,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:50,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,025 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:51,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-26 20:43:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:51,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:51,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:51,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,123 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:51,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:51,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:51,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,433 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:51,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:51,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:51,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:51,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:51,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:51,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:51,814 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:52,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:52,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:52,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:43:52,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:52,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:52,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:52,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:52,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:52,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:52,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:52,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:52,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,257 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:52,257 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,345 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,345 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:52,347 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,387 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:52,388 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,452 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:52,452 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,548 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:52,548 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,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:43:52,572 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,611 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,612 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,612 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,634 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,634 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,655 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,656 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,724 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:52,724 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,744 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,744 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,762 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,762 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,779 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,779 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,800 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,800 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:52,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:52,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:52,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:52,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:52,844 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:52,844 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:52,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:52,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:52,895 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:52,895 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,924 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,924 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,950 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,950 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:52,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:52,978 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,011 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:53,011 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,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, 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:53,074 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,118 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:53,119 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,138 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,138 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,157 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,157 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,215 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:53,215 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,235 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,236 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,253 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,253 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,316 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:53,317 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,334 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,334 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,378 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,378 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:53,379 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,398 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,399 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,426 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,442 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,473 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:53,474 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,501 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:53,502 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,544 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:53,545 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,564 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,565 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,596 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,596 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,619 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,619 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,666 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:53,667 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,685 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,685 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,767 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:53,768 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,785 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,786 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,817 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:53,818 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:53,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:53,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:53,920 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:53,921 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,938 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,938 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:53,975 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:53,975 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,015 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,016 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:54,017 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,049 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:54,066 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,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:54,105 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,122 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,123 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,141 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,142 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,161 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,161 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,179 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,180 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,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, 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:54,245 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,275 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,276 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:54,276 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,296 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,296 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,313 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,313 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,345 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,345 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:54,346 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,364 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,365 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,383 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,383 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,413 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,482 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:54,483 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,506 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,506 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,531 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:54,532 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,592 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:54,593 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,615 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,642 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:54,642 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,661 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,662 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,679 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,680 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,733 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:54,734 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,778 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-26 20:43:54,779 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,798 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,799 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,816 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,816 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,858 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:54,859 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,876 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,876 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:54,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,924 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:54,925 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,943 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:54,943 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:54,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:54,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:54,989 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:54,990 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,015 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,023 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,034 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:55,034 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,066 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,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:55,067 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,092 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:55,092 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,111 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,111 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,155 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:55,156 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,183 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:55,184 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:55,206 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:55,206 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,224 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,225 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,245 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,245 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,246 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:55,246 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,262 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,263 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,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, 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:55,293 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,309 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,310 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,326 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,327 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-26 20:43:55,355 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,372 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,372 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,389 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,389 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,405 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,406 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,422 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,423 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,442 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,443 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,458 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,458 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,475 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,475 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,497 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:55,498 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,515 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,515 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,531 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,531 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,548 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,548 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,563 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,565 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,587 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,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, 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:55,593 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,610 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,610 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,626 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,626 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,647 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,650 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,665 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,666 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,684 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,685 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,701 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,701 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:55,735 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:55,735 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,751 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,751 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,768 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,768 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,783 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,784 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,799 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,799 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,815 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,816 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,816 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,820 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:55,820 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,840 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,841 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,859 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,859 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,874 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,874 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,890 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,891 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,905 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,905 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,920 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,921 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,943 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,945 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:55,946 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:55,946 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,962 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,979 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:55,979 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:55,993 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:55,993 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,007 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,008 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,020 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,021 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,036 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,036 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,051 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,052 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,065 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,066 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,079 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,079 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,095 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,095 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,111 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,111 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,127 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,127 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,142 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,142 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,155 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,155 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,201 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,202 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,210 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,210 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,218 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,219 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,226 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,226 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,235 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,235 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,243 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,243 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,250 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,250 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,267 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,267 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,275 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,275 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,283 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,284 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,291 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,292 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,299 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,300 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,308 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,308 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,316 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,317 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,324 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:43:56,324 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,477 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-11-26 20:43:56,477 INFO L588 ElimStorePlain]: treesize reduction 812, result has 4.8 percent of original size [2019-11-26 20:43:56,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,490 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:56,491 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:56,496 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:56,496 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,517 INFO L588 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-26 20:43:56,517 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:56,518 INFO L221 ElimStorePlain]: Needed 153 recursive calls to eliminate 7 variables, input treesize:7571, output treesize:10 [2019-11-26 20:43:56,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:56,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:56,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:43:56,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:56,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:56,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:56,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:56,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:43:56,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:43:56,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:43:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:43:56,611 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:43:56,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,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 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-26 20:43:56,822 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,906 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:56,906 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,907 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:56,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:56,937 INFO L189 IndexEqualityManager]: detected not equals via solver [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,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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,990 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,014 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,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,081 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:57,082 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,268 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:57,269 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,305 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,305 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:57,306 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,400 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:57,400 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,463 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:57,464 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,534 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:57,535 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,574 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:57,575 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,597 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,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,702 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:57,703 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:57,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,746 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:57,746 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,832 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:57,832 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:57,917 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:57,918 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:57,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:57,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,037 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:58,038 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,096 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:58,097 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,124 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,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,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, 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:58,190 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,281 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:58,282 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,339 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:58,339 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,379 INFO L189 IndexEqualityManager]: detected not equals 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, 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:58,463 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,485 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,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,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 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-26 20:43:58,556 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:58,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,687 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:58,688 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,726 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,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,811 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:58,812 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:58,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:58,871 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:58,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:58,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 36 treesize of output 158 [2019-11-26 20:43:59,050 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,109 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:59,110 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:43:59,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,202 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:59,203 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,327 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:59,328 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,367 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:59,368 INFO L508 ElimStorePlain]: Start of recursive call 30: 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,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,454 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,455 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:59,456 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,526 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, 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:59,527 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,590 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:59,591 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,680 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,680 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:59,681 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,857 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:59,858 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:43:59,944 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:59,945 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:43:59,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:43:59,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,015 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:44:00,016 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,143 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:44:00,144 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,169 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,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,235 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:44:00,235 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,326 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:44:00,327 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:00,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,458 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:44:00,459 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,503 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:44:00,503 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,632 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:44:00,633 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,678 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:44:00,678 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,774 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:44:00,775 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,870 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:44:00,871 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:00,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:00,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:00,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 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-26 20:44:00,989 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,114 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:44:01,115 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,198 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:44:01,199 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,278 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:44:01,279 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,316 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:44:01,316 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:01,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,408 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:44:01,409 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,535 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:44:01,536 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,665 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:44:01,666 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,836 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:44:01,837 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,899 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:44:01,900 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,957 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:01,957 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:44:01,958 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:01,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:01,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,084 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:44:02,085 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,209 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:44:02,210 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,297 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:44:02,298 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,443 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:44:02,444 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:02,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,534 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:44:02,534 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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:44:02,622 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:02,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,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 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-26 20:44:02,715 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,761 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:02,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,782 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:44:02,783 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,875 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:44:02,876 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:02,963 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:44:02,964 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:02,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:02,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,051 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:44:03,052 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,092 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:44:03,092 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,186 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:44:03,186 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,313 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:44:03,314 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,436 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:44:03,436 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,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, 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:44:03,567 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,624 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:44:03,625 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,811 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:44:03,812 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,839 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:44:03,840 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,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, 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:44:03,903 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:03,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:03,991 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:03,991 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:44:03,992 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,018 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,030 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:04,030 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,052 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,055 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:44:04,056 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,096 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:04,096 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,138 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,139 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,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, 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:44:04,158 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,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, 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:04,199 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,328 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:44:04,328 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,350 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,365 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:04,365 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,406 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,414 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:04,414 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,587 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:44:04,589 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,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:44:04,679 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,736 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,789 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:44:04,790 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,813 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:04,821 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:04,821 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:04,887 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:44:04,887 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:04,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:04,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,078 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:44:05,079 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,105 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,116 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,122 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:44:05,123 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,248 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:44:05,249 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,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, 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:05,336 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,362 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:05,362 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,451 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:44:05,452 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,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 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-26 20:44:05,546 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,637 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:44:05,638 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,677 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:44:05,678 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-26 20:44:05,737 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,786 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:44:05,786 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,826 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:05,826 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:05,856 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:44:05,856 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:05,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:05,944 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:44:05,944 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:05,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,009 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:44:06,009 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,133 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:06,133 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,178 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:44:06,178 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,239 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,270 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:06,271 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,354 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:06,355 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,410 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,423 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:44:06,424 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,476 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:06,477 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,530 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:06,530 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,547 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,551 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:06,551 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,575 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,582 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:44:06,583 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,618 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:44:06,619 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,643 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,673 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,673 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:06,674 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,806 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:44:06,806 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,899 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:06,899 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:06,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:06,955 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:06,956 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:06,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:06,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,002 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,139 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:44:07,140 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,198 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:07,199 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,301 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:07,302 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,368 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:44:07,369 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,432 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:44:07,433 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,454 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,462 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,469 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:07,469 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,535 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,591 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:44:07,592 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,649 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:07,650 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,668 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:44:07,669 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,696 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,732 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:44:07,732 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,759 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,773 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:44:07,774 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,793 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,795 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,797 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:44:07,797 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,813 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,815 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:44:07,815 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,867 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:44:07,867 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,892 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:07,892 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,922 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:07,954 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:07,954 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:07,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:07,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:07,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,013 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:08,014 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:08,047 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,073 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,086 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:08,086 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,141 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:08,142 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,225 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:08,225 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,279 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:08,279 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,406 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:44:08,407 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,424 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,463 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:44:08,464 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,496 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,497 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:44:08,497 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,518 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,539 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:44:08,539 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,572 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:08,573 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,597 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,610 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:08,611 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,637 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-26 20:44:08,646 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,691 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,730 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:08,731 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,769 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:44:08,770 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,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, 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:08,806 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,863 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:08,863 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,913 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:08,954 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:08,954 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:08,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:08,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:08,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,018 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:09,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, 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:44:09,074 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:09,179 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:09,179 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,202 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:09,215 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:09,216 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,260 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:09,298 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:09,298 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,320 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:44:09,320 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,407 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:09,407 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:09,408 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,428 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:44:09,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:44:09,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:44:09,449 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:09,450 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,890 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 16 [2019-11-26 20:44:09,890 INFO L588 ElimStorePlain]: treesize reduction 3843, result has 0.5 percent of original size [2019-11-26 20:44:09,893 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:09,894 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-26 20:44:09,908 INFO L588 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-26 20:44:09,908 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:09,909 INFO L221 ElimStorePlain]: Needed 162 recursive calls to eliminate 8 variables, input treesize:8783, output treesize:14 [2019-11-26 20:44:09,990 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:09,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:44:09,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2019-11-26 20:44:09,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024865299] [2019-11-26 20:44:09,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 20:44:09,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:44:09,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 20:44:09,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-26 20:44:09,992 INFO L87 Difference]: Start difference. First operand 245 states and 333 transitions. Second operand 19 states. [2019-11-26 20:44:10,630 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-26 20:44:21,001 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:30,466 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-26 20:44:40,509 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-26 20:44:40,742 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-11-26 20:44:41,023 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-26 20:44:41,218 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-26 20:45:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:45:45,395 INFO L93 Difference]: Finished difference Result 387 states and 520 transitions. [2019-11-26 20:45:45,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-26 20:45:45,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-26 20:45:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:45:45,399 INFO L225 Difference]: With dead ends: 387 [2019-11-26 20:45:45,400 INFO L226 Difference]: Without dead ends: 387 [2019-11-26 20:45:45,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=441, Invalid=1199, Unknown=0, NotChecked=0, Total=1640 [2019-11-26 20:45:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-26 20:45:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 319. [2019-11-26 20:45:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-26 20:45:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 441 transitions. [2019-11-26 20:45:45,416 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 441 transitions. Word has length 35 [2019-11-26 20:45:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:45:45,416 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 441 transitions. [2019-11-26 20:45:45,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 20:45:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 441 transitions. [2019-11-26 20:45:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 20:45:45,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:45:45,418 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:45:45,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:45:45,624 INFO L410 AbstractCegarLoop]: === Iteration 17 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:45:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:45:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2659210, now seen corresponding path program 1 times [2019-11-26 20:45:45,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:45:45,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676744390] [2019-11-26 20:45:45,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:45:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:45,944 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:45:45,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676744390] [2019-11-26 20:45:45,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006707289] [2019-11-26 20:45:45,945 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:45:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:46,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-26 20:45:46,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:45:46,149 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_38|], 5=[|v_#valid_53|]} [2019-11-26 20:45:46,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:46,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:46,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:46,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:46,343 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-26 20:45:46,343 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-26 20:45:46,344 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:45:46,344 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:46,432 INFO L588 ElimStorePlain]: treesize reduction 50, result has 59.7 percent of original size [2019-11-26 20:45:46,443 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:45:46,444 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:45:46,534 INFO L588 ElimStorePlain]: treesize reduction 26, result has 72.9 percent of original size [2019-11-26 20:45:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,555 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:45:46,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:70 [2019-11-26 20:45:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:45:47,427 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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:45:47,500 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,538 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:45:47,539 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,579 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:45:47,579 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,594 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,595 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:45:47,595 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:47,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:47,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:47,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:47,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,615 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 18 [2019-11-26 20:45:47,616 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,621 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:47,622 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:45:47,655 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,671 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:45:47,671 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,677 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:47,677 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:47,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:47,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,698 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:45:47,699 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:47,715 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:45:47,715 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,721 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:47,721 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,730 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:45:47,730 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,735 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:47,736 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,740 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:47,741 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,745 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:47,745 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:47,794 INFO L588 ElimStorePlain]: treesize reduction 224, result has 4.7 percent of original size [2019-11-26 20:45:47,795 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:45:47,795 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:669, output treesize:7 [2019-11-26 20:45:47,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:47,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:48,258 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-11-26 20:45:48,314 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:45:48,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:45:48,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2019-11-26 20:45:48,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462233564] [2019-11-26 20:45:48,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 20:45:48,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:45:48,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 20:45:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-26 20:45:48,316 INFO L87 Difference]: Start difference. First operand 319 states and 441 transitions. Second operand 13 states. [2019-11-26 20:45:48,559 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-26 20:45:49,288 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-26 20:45:49,669 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-11-26 20:45:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:45:50,177 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2019-11-26 20:45:50,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:45:50,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-26 20:45:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:45:50,181 INFO L225 Difference]: With dead ends: 331 [2019-11-26 20:45:50,181 INFO L226 Difference]: Without dead ends: 329 [2019-11-26 20:45:50,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:45:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-26 20:45:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2019-11-26 20:45:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-26 20:45:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 436 transitions. [2019-11-26 20:45:50,202 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 436 transitions. Word has length 34 [2019-11-26 20:45:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:45:50,202 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 436 transitions. [2019-11-26 20:45:50,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 20:45:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 436 transitions. [2019-11-26 20:45:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 20:45:50,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:45:50,204 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:45:50,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:45:50,410 INFO L410 AbstractCegarLoop]: === Iteration 18 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:45:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:45:50,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1559342765, now seen corresponding path program 1 times [2019-11-26 20:45:50,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:45:50,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941564480] [2019-11-26 20:45:50,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:45:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:51,131 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:45:51,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941564480] [2019-11-26 20:45:51,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188029069] [2019-11-26 20:45:51,132 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:45:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:51,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 20:45:51,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:45:51,439 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:45:51,440 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:51,449 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:51,463 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:45:51,464 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:51,471 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:51,471 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:45:51,472 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-26 20:45:51,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:51,544 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:45:51,544 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:51,556 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:51,560 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:45:51,561 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:51,571 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:51,572 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:45:51,572 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-26 20:45:51,656 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:45:51,657 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:51,667 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:51,671 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:45:51,671 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:51,679 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:51,680 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:45:51,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-26 20:45:51,713 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:45:51,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:45:51,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 26 [2019-11-26 20:45:51,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873620871] [2019-11-26 20:45:51,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-26 20:45:51,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:45:51,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-26 20:45:51,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-11-26 20:45:51,715 INFO L87 Difference]: Start difference. First operand 317 states and 436 transitions. Second operand 27 states. [2019-11-26 20:45:52,020 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-26 20:45:52,228 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-11-26 20:45:53,153 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-26 20:45:53,369 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-11-26 20:45:53,747 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-26 20:45:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:45:54,962 INFO L93 Difference]: Finished difference Result 361 states and 488 transitions. [2019-11-26 20:45:54,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-26 20:45:54,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-11-26 20:45:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:45:54,965 INFO L225 Difference]: With dead ends: 361 [2019-11-26 20:45:54,965 INFO L226 Difference]: Without dead ends: 361 [2019-11-26 20:45:54,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2019-11-26 20:45:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-26 20:45:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 318. [2019-11-26 20:45:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-26 20:45:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 433 transitions. [2019-11-26 20:45:54,978 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 433 transitions. Word has length 37 [2019-11-26 20:45:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:45:54,979 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 433 transitions. [2019-11-26 20:45:54,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-26 20:45:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 433 transitions. [2019-11-26 20:45:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 20:45:54,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:45:54,981 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:45:55,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:45:55,186 INFO L410 AbstractCegarLoop]: === Iteration 19 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:45:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:45:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1566995341, now seen corresponding path program 1 times [2019-11-26 20:45:55,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:45:55,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99691954] [2019-11-26 20:45:55,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:45:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 20:45:55,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99691954] [2019-11-26 20:45:55,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:45:55,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:45:55,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088235541] [2019-11-26 20:45:55,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:45:55,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:45:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:45:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:45:55,378 INFO L87 Difference]: Start difference. First operand 318 states and 433 transitions. Second operand 9 states. [2019-11-26 20:45:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:45:55,865 INFO L93 Difference]: Finished difference Result 316 states and 409 transitions. [2019-11-26 20:45:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:45:55,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-11-26 20:45:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:45:55,868 INFO L225 Difference]: With dead ends: 316 [2019-11-26 20:45:55,868 INFO L226 Difference]: Without dead ends: 316 [2019-11-26 20:45:55,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:45:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-26 20:45:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2019-11-26 20:45:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-26 20:45:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2019-11-26 20:45:55,879 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 46 [2019-11-26 20:45:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:45:55,880 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2019-11-26 20:45:55,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:45:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2019-11-26 20:45:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 20:45:55,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:45:55,881 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:55,881 INFO L410 AbstractCegarLoop]: === Iteration 20 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:45:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:45:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash -415186385, now seen corresponding path program 1 times [2019-11-26 20:45:55,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:45:55,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367312913] [2019-11-26 20:45:55,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:45:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:56,443 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:56,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367312913] [2019-11-26 20:45:56,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540947488] [2019-11-26 20:45:56,444 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:45:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:45:56,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-26 20:45:56,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:45:56,611 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_40|], 8=[|v_#valid_55|]} [2019-11-26 20:45:56,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:56,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:56,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:56,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:56,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:56,836 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-26 20:45:56,836 INFO L343 Elim1Store]: treesize reduction 86, result has 52.7 percent of original size [2019-11-26 20:45:56,837 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:56,837 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:56,973 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-26 20:45:56,974 INFO L588 ElimStorePlain]: treesize reduction 50, result has 68.6 percent of original size [2019-11-26 20:45:56,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:56,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 75 [2019-11-26 20:45:56,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:56,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:56,998 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-26 20:45:57,137 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-26 20:45:57,138 INFO L588 ElimStorePlain]: treesize reduction 123, result has 44.3 percent of original size [2019-11-26 20:45:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,148 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:57,148 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:98 [2019-11-26 20:45:57,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:57,697 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:57,697 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:57,698 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:57,723 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:57,723 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,734 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:57,734 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:57,821 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:57,822 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:57,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:57,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:57,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:57,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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:57,860 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:57,914 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:57,914 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,922 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:57,922 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:57,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:57,970 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:57,971 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:57,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:57,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:45:58,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:58,000 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:58,001 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:58,012 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:58,013 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:58,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:58,039 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:58,039 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:58,039 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:58,046 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:58,046 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:58,052 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:45:58,052 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:58,258 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-26 20:45:58,258 INFO L588 ElimStorePlain]: treesize reduction 297, result has 33.0 percent of original size [2019-11-26 20:45:58,259 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:58,259 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:951, output treesize:67 [2019-11-26 20:45:58,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:58,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:45:59,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:59,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:59,588 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:59,589 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:59,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:59,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:59,668 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:59,669 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:59,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:59,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:59,769 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:59,770 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:59,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:45:59,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:45:59,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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:59,943 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:45:59,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:00,117 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-26 20:46:00,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:00,118 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:46:00,119 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:00,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:00,329 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-26 20:46:00,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:00,330 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:46:00,332 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:00,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:00,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:00,442 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:46:00,443 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:00,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:00,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:00,548 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:46:00,550 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:00,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:00,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:00,699 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:46:00,701 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:00,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:00,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:00,771 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:46:00,772 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:00,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:00,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:00,924 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:46:00,925 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:00,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:01,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:01,029 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:46:01,030 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:46:01,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:01,139 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:46:01,140 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,740 WARN L192 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 95 [2019-11-26 20:46:01,740 INFO L588 ElimStorePlain]: treesize reduction 1386, result has 20.1 percent of original size [2019-11-26 20:46:01,749 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:46:01,749 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,755 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:46:01,755 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,762 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:46:01,762 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,768 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:46:01,768 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,776 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:46:01,777 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,956 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-26 20:46:01,957 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:01,965 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:46:01,965 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,971 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:46:01,971 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,977 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:46:01,978 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,984 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:46:01,984 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:01,991 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:46:01,991 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:46:02,153 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:46:02,154 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:46:02,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,175 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:46:02,175 INFO L221 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:795, output treesize:278 [2019-11-26 20:46:02,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:46:02,534 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-26 20:46:02,669 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:46:02,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:46:02,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-11-26 20:46:02,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868819333] [2019-11-26 20:46:02,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 20:46:02,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:46:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 20:46:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:46:02,672 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand 23 states. [2019-11-26 20:46:03,794 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-11-26 20:46:04,224 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-26 20:46:04,400 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-26 20:46:04,804 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-11-26 20:46:06,479 WARN L192 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-11-26 20:46:24,360 WARN L192 SmtUtils]: Spent 8.54 s on a formula simplification. DAG size of input: 226 DAG size of output: 184 [2019-11-26 20:46:31,224 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-26 20:46:32,296 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-11-26 20:46:54,137 WARN L192 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2019-11-26 20:47:23,185 WARN L192 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-26 20:47:27,778 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-11-26 20:47:30,292 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-26 20:47:37,791 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2019-11-26 20:47:37,960 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-26 20:47:38,458 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 148 [2019-11-26 20:47:39,150 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2019-11-26 20:47:46,954 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-26 20:47:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:47:48,789 INFO L93 Difference]: Finished difference Result 389 states and 462 transitions. [2019-11-26 20:47:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-26 20:47:48,790 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-26 20:47:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:47:48,792 INFO L225 Difference]: With dead ends: 389 [2019-11-26 20:47:48,792 INFO L226 Difference]: Without dead ends: 389 [2019-11-26 20:47:48,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=510, Invalid=1638, Unknown=14, NotChecked=0, Total=2162 [2019-11-26 20:47:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-26 20:47:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 334. [2019-11-26 20:47:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-26 20:47:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 410 transitions. [2019-11-26 20:47:48,805 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 410 transitions. Word has length 39 [2019-11-26 20:47:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:47:48,805 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 410 transitions. [2019-11-26 20:47:48,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 20:47:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 410 transitions. [2019-11-26 20:47:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:47:48,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:47:48,807 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:47:49,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:47:49,011 INFO L410 AbstractCegarLoop]: === Iteration 21 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:47:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:47:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1604386484, now seen corresponding path program 1 times [2019-11-26 20:47:49,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:47:49,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643156425] [2019-11-26 20:47:49,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:47:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:49,834 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:47:49,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643156425] [2019-11-26 20:47:49,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662499219] [2019-11-26 20:47:49,835 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:47:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:47:49,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-26 20:47:49,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:47:49,997 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_42|], 15=[|v_#valid_56|]} [2019-11-26 20:47:50,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,092 INFO L343 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2019-11-26 20:47:50,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:47:50,093 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:50,140 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:50,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:50,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:50,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 172 [2019-11-26 20:47:50,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:50,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:50,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:50,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:50,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:50,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:50,174 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:50,290 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-11-26 20:47:50,291 INFO L588 ElimStorePlain]: treesize reduction 209, result has 33.2 percent of original size [2019-11-26 20:47:50,292 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:50,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:104 [2019-11-26 20:47:50,415 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:50,416 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:47:50,416 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:50,451 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:50,452 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:47:50,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:53 [2019-11-26 20:47:51,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:47:51,119 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-26 20:47:51,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:51,120 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:47:51,122 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:51,285 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-11-26 20:47:51,286 INFO L588 ElimStorePlain]: treesize reduction 84, result has 61.5 percent of original size [2019-11-26 20:47:51,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,294 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:47:51,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:107, output treesize:134 [2019-11-26 20:47:51,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:51,834 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-26 20:47:52,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:47:52,510 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:47:52,511 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:52,657 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-26 20:47:52,658 INFO L588 ElimStorePlain]: treesize reduction 28, result has 84.3 percent of original size [2019-11-26 20:47:52,663 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:47:52,663 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:52,724 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:52,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, 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:47:52,730 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:52,780 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:52,785 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:47:52,785 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:47:52,828 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:47:52,829 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:47:52,830 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:208, output treesize:84 [2019-11-26 20:47:55,028 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-26 20:47:55,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:47:55,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:47:55,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2019-11-26 20:47:55,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99627774] [2019-11-26 20:47:55,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-26 20:47:55,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:47:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-26 20:47:55,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-11-26 20:47:55,063 INFO L87 Difference]: Start difference. First operand 334 states and 410 transitions. Second operand 28 states. [2019-11-26 20:47:55,347 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-26 20:47:55,640 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-11-26 20:47:56,051 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-26 20:47:56,528 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-26 20:47:56,806 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-11-26 20:47:57,078 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-26 20:47:57,672 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-11-26 20:47:58,130 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-26 20:47:58,468 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-26 20:47:58,934 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-11-26 20:47:59,531 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 129 [2019-11-26 20:48:00,155 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-11-26 20:48:00,971 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2019-11-26 20:48:01,596 WARN L192 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-11-26 20:48:01,976 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2019-11-26 20:48:02,689 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-11-26 20:48:03,241 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:48:04,120 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:48:04,366 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-26 20:48:04,828 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:48:05,099 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-26 20:48:05,615 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-26 20:48:06,240 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-11-26 20:48:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:06,669 INFO L93 Difference]: Finished difference Result 408 states and 478 transitions. [2019-11-26 20:48:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-26 20:48:06,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-26 20:48:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:06,671 INFO L225 Difference]: With dead ends: 408 [2019-11-26 20:48:06,671 INFO L226 Difference]: Without dead ends: 408 [2019-11-26 20:48:06,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=751, Invalid=2671, Unknown=0, NotChecked=0, Total=3422 [2019-11-26 20:48:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-26 20:48:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 333. [2019-11-26 20:48:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-26 20:48:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 406 transitions. [2019-11-26 20:48:06,682 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 406 transitions. Word has length 45 [2019-11-26 20:48:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:06,682 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 406 transitions. [2019-11-26 20:48:06,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-26 20:48:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 406 transitions. [2019-11-26 20:48:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:48:06,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:06,683 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:06,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:06,888 INFO L410 AbstractCegarLoop]: === Iteration 22 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:06,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1186742862, now seen corresponding path program 1 times [2019-11-26 20:48:06,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:06,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049110575] [2019-11-26 20:48:06,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:48:07,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049110575] [2019-11-26 20:48:07,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266293728] [2019-11-26 20:48:07,074 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:48:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 20:48:07,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:48:07,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:07,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-26 20:48:07,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183835868] [2019-11-26 20:48:07,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:48:07,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:48:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:48:07,302 INFO L87 Difference]: Start difference. First operand 333 states and 406 transitions. Second operand 6 states. [2019-11-26 20:48:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:07,593 INFO L93 Difference]: Finished difference Result 345 states and 417 transitions. [2019-11-26 20:48:07,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:48:07,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-26 20:48:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:07,598 INFO L225 Difference]: With dead ends: 345 [2019-11-26 20:48:07,598 INFO L226 Difference]: Without dead ends: 345 [2019-11-26 20:48:07,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:48:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-26 20:48:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 332. [2019-11-26 20:48:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-26 20:48:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 404 transitions. [2019-11-26 20:48:07,606 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 404 transitions. Word has length 50 [2019-11-26 20:48:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:07,607 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 404 transitions. [2019-11-26 20:48:07,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:48:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 404 transitions. [2019-11-26 20:48:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 20:48:07,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:07,608 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:07,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:07,813 INFO L410 AbstractCegarLoop]: === Iteration 23 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1865676899, now seen corresponding path program 1 times [2019-11-26 20:48:07,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:07,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849802365] [2019-11-26 20:48:07,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:48:07,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849802365] [2019-11-26 20:48:07,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681076026] [2019-11-26 20:48:07,959 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:48:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:08,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 20:48:08,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:48:08,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:08,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-26 20:48:08,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59044169] [2019-11-26 20:48:08,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:48:08,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:48:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:48:08,134 INFO L87 Difference]: Start difference. First operand 332 states and 404 transitions. Second operand 6 states. [2019-11-26 20:48:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:08,426 INFO L93 Difference]: Finished difference Result 344 states and 415 transitions. [2019-11-26 20:48:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:48:08,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-26 20:48:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:08,430 INFO L225 Difference]: With dead ends: 344 [2019-11-26 20:48:08,430 INFO L226 Difference]: Without dead ends: 344 [2019-11-26 20:48:08,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:48:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-26 20:48:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2019-11-26 20:48:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-26 20:48:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 402 transitions. [2019-11-26 20:48:08,438 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 402 transitions. Word has length 51 [2019-11-26 20:48:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:08,439 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 402 transitions. [2019-11-26 20:48:08,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:48:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 402 transitions. [2019-11-26 20:48:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 20:48:08,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:08,440 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:08,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:08,644 INFO L410 AbstractCegarLoop]: === Iteration 24 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2001408976, now seen corresponding path program 1 times [2019-11-26 20:48:08,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:08,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840407700] [2019-11-26 20:48:08,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:48:08,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840407700] [2019-11-26 20:48:08,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609913010] [2019-11-26 20:48:08,780 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:48:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:08,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-26 20:48:08,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:08,950 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:48:08,951 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:08,952 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:08,953 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:08,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 20:48:08,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:08,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-26 20:48:08,974 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:08,991 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-26 20:48:08,991 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 20:48:08,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-26 20:48:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:48:09,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:09,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-26 20:48:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881052988] [2019-11-26 20:48:09,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:48:09,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:48:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:48:09,009 INFO L87 Difference]: Start difference. First operand 331 states and 402 transitions. Second operand 7 states. [2019-11-26 20:48:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:09,755 INFO L93 Difference]: Finished difference Result 357 states and 421 transitions. [2019-11-26 20:48:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:48:09,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-26 20:48:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:09,759 INFO L225 Difference]: With dead ends: 357 [2019-11-26 20:48:09,759 INFO L226 Difference]: Without dead ends: 357 [2019-11-26 20:48:09,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:48:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-26 20:48:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 334. [2019-11-26 20:48:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-26 20:48:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 404 transitions. [2019-11-26 20:48:09,767 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 404 transitions. Word has length 52 [2019-11-26 20:48:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:09,767 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 404 transitions. [2019-11-26 20:48:09,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:48:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 404 transitions. [2019-11-26 20:48:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 20:48:09,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:09,769 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:48:09,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:09,973 INFO L410 AbstractCegarLoop]: === Iteration 25 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1038016890, now seen corresponding path program 1 times [2019-11-26 20:48:09,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:09,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367789179] [2019-11-26 20:48:09,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:10,155 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:48:10,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367789179] [2019-11-26 20:48:10,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188525484] [2019-11-26 20:48:10,156 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:48:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:10,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 20:48:10,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:10,495 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:48:10,496 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:48:10,496 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:10,496 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:10,551 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-26 20:48:10,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:10,553 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:10,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-26 20:48:10,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:10,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:10,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:11,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:11,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:11,319 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:11,319 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:11,320 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,321 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,321 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,322 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,322 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,323 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,323 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,324 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,324 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,325 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,325 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,326 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,326 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,327 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:11,327 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:11,327 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-26 20:48:11,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:11,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:11,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:11,705 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:11,706 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,707 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,707 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,708 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,708 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,708 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,709 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,709 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,709 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,710 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,710 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:11,711 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:11,712 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:11,713 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:11,713 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-26 20:48:11,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:11,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:11,940 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:48:11,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:11,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-26 20:48:11,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012119507] [2019-11-26 20:48:11,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:48:11,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:11,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:48:11,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:48:11,942 INFO L87 Difference]: Start difference. First operand 334 states and 404 transitions. Second operand 12 states. [2019-11-26 20:48:12,283 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-26 20:48:14,805 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-26 20:48:14,976 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-26 20:48:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:19,341 INFO L93 Difference]: Finished difference Result 354 states and 419 transitions. [2019-11-26 20:48:19,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:48:19,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-26 20:48:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:19,344 INFO L225 Difference]: With dead ends: 354 [2019-11-26 20:48:19,344 INFO L226 Difference]: Without dead ends: 354 [2019-11-26 20:48:19,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:48:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-26 20:48:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 334. [2019-11-26 20:48:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-26 20:48:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 401 transitions. [2019-11-26 20:48:19,352 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 401 transitions. Word has length 54 [2019-11-26 20:48:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:19,353 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 401 transitions. [2019-11-26 20:48:19,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:48:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 401 transitions. [2019-11-26 20:48:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 20:48:19,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:19,354 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:48:19,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:19,558 INFO L410 AbstractCegarLoop]: === Iteration 26 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2113752430, now seen corresponding path program 1 times [2019-11-26 20:48:19,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:19,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094066843] [2019-11-26 20:48:19,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:19,727 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:48:19,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094066843] [2019-11-26 20:48:19,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106438210] [2019-11-26 20:48:19,728 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:48:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:19,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-26 20:48:19,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:20,068 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:48:20,069 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:48:20,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:20,070 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,142 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-26 20:48:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,156 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:20,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:54 [2019-11-26 20:48:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,416 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:48:20,417 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,467 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:48:20,467 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,517 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:48:20,518 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,549 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:48:20,550 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,563 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:48:20,564 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,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:48:20,591 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,603 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:48:20,603 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,613 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,635 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 34 [2019-11-26 20:48:20,635 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 37 [2019-11-26 20:48:20,666 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,675 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,683 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,684 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:48:20,684 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,696 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,697 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,702 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:48:20,702 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,717 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:48:20,717 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,723 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 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:48:20,737 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,747 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:48:20,747 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,757 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:48:20,757 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:20,770 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:48:20,770 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,776 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,779 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:48:20,779 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,788 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:48:20,788 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,798 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,799 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:48:20,799 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,811 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:48:20,811 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,818 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:48:20,819 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,829 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:48:20,829 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,840 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:48:20,841 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,851 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:48:20,851 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:20,861 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:48:20,861 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,868 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:20,869 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,874 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:20,874 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,877 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:20,878 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,883 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:20,883 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,888 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:20,888 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:20,894 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,897 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:20,897 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:20,932 INFO L588 ElimStorePlain]: treesize reduction 143, result has 4.7 percent of original size [2019-11-26 20:48:20,932 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:20,933 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-26 20:48:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:20,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,039 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,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, 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:48:21,040 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,053 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:48:21,054 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,084 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:48:21,084 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-26 20:48:21,097 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,119 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:48:21,119 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,126 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,129 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:48:21,129 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,159 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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:48:21,160 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,169 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,177 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:48:21,177 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,204 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:48:21,205 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,244 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:48:21,245 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,258 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:48:21,258 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,265 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,265 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,269 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:48:21,269 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,280 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:48:21,281 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,294 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:21,294 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:48:21,294 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,303 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:48:21,304 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,311 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:48:21,315 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,327 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,327 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,327 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:48:21,328 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,338 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:48:21,338 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,348 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:48:21,348 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,365 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:48:21,365 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,370 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,372 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,372 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,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, 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:48:21,374 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,379 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,383 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:48:21,383 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,394 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:48:21,394 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,402 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:48:21,402 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,409 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,410 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,410 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,411 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:48:21,412 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:48:21,412 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,438 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:21,439 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,446 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:21,446 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,453 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:21,453 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,459 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:21,460 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,466 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:21,466 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,471 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:21,471 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,475 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:21,476 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:21,506 INFO L588 ElimStorePlain]: treesize reduction 90, result has 7.2 percent of original size [2019-11-26 20:48:21,506 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:21,507 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-26 20:48:21,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:21,797 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 17 [2019-11-26 20:48:21,836 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:48:21,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:21,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-26 20:48:21,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309574370] [2019-11-26 20:48:21,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:48:21,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:21,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:48:21,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:48:21,838 INFO L87 Difference]: Start difference. First operand 334 states and 401 transitions. Second operand 12 states. [2019-11-26 20:48:22,062 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-26 20:48:22,666 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-26 20:48:22,987 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-26 20:48:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:23,245 INFO L93 Difference]: Finished difference Result 349 states and 415 transitions. [2019-11-26 20:48:23,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:48:23,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-26 20:48:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:23,248 INFO L225 Difference]: With dead ends: 349 [2019-11-26 20:48:23,248 INFO L226 Difference]: Without dead ends: 349 [2019-11-26 20:48:23,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:48:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-26 20:48:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 334. [2019-11-26 20:48:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-26 20:48:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 399 transitions. [2019-11-26 20:48:23,257 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 399 transitions. Word has length 55 [2019-11-26 20:48:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:23,258 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 399 transitions. [2019-11-26 20:48:23,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:48:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 399 transitions. [2019-11-26 20:48:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 20:48:23,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:23,260 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:48:23,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:23,464 INFO L410 AbstractCegarLoop]: === Iteration 27 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:23,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:23,465 INFO L82 PathProgramCache]: Analyzing trace with hash -921542745, now seen corresponding path program 1 times [2019-11-26 20:48:23,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:23,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132202716] [2019-11-26 20:48:23,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:23,810 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:48:23,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132202716] [2019-11-26 20:48:23,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237026560] [2019-11-26 20:48:23,810 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:48:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:23,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-26 20:48:23,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:23,973 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_45|], 9=[|v_#valid_60|]} [2019-11-26 20:48:23,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:23,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:23,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:23,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:23,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:23,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,064 INFO L343 Elim1Store]: treesize reduction 142, result has 12.9 percent of original size [2019-11-26 20:48:24,064 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:48:24,065 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:24,098 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-26 20:48:24,117 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:48:24,183 INFO L588 ElimStorePlain]: treesize reduction 14, result has 81.6 percent of original size [2019-11-26 20:48:24,184 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:24,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:62 [2019-11-26 20:48:24,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,286 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:24,286 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:24,307 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,308 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:48:24,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-26 20:48:24,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,382 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:24,383 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:24,402 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,402 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:48:24,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-26 20:48:24,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:48:24,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,809 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:48:24,810 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:24,902 INFO L588 ElimStorePlain]: treesize reduction 34, result has 67.9 percent of original size [2019-11-26 20:48:24,906 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:48:24,906 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:24,941 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,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, 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:48:24,946 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:24,978 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:24,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,982 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:48:24,982 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:58 [2019-11-26 20:48:24,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:24,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:25,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:25,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:25,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:25,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:25,276 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-26 20:48:25,420 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:48:25,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:25,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2019-11-26 20:48:25,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733186855] [2019-11-26 20:48:25,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-26 20:48:25,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:25,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-26 20:48:25,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:48:25,423 INFO L87 Difference]: Start difference. First operand 334 states and 399 transitions. Second operand 21 states. [2019-11-26 20:48:25,673 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-26 20:48:25,901 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-26 20:48:26,339 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-26 20:48:26,560 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-26 20:48:27,035 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-26 20:48:27,510 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-26 20:48:27,785 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-26 20:48:28,330 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-26 20:48:28,670 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2019-11-26 20:48:29,076 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-26 20:48:29,381 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-26 20:48:29,805 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-26 20:48:30,285 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-26 20:48:31,407 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-11-26 20:48:31,901 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-26 20:48:32,659 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-26 20:48:34,029 WARN L192 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 151 [2019-11-26 20:48:35,204 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-26 20:48:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:48:37,479 INFO L93 Difference]: Finished difference Result 352 states and 412 transitions. [2019-11-26 20:48:37,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-26 20:48:37,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-11-26 20:48:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:48:37,482 INFO L225 Difference]: With dead ends: 352 [2019-11-26 20:48:37,483 INFO L226 Difference]: Without dead ends: 352 [2019-11-26 20:48:37,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=475, Invalid=1505, Unknown=0, NotChecked=0, Total=1980 [2019-11-26 20:48:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-26 20:48:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 333. [2019-11-26 20:48:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-26 20:48:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 393 transitions. [2019-11-26 20:48:37,490 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 393 transitions. Word has length 60 [2019-11-26 20:48:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:48:37,490 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 393 transitions. [2019-11-26 20:48:37,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-26 20:48:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 393 transitions. [2019-11-26 20:48:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 20:48:37,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:48:37,492 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:48:37,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:48:37,693 INFO L410 AbstractCegarLoop]: === Iteration 28 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:48:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:48:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash 410180855, now seen corresponding path program 1 times [2019-11-26 20:48:37,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:48:37,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480325168] [2019-11-26 20:48:37,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:48:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:38,426 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-11-26 20:48:39,020 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-26 20:48:39,470 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-26 20:48:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 20:48:39,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480325168] [2019-11-26 20:48:39,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169906822] [2019-11-26 20:48:39,491 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:48:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:48:39,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-26 20:48:39,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:48:39,848 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:48:39,848 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:48:39,849 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:39,849 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:39,903 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-26 20:48:39,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:39,905 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:39,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-26 20:48:39,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:39,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:40,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:40,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:40,797 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:48:40,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:40,798 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:48:40,800 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:40,919 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:40,920 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,921 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:40,921 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,922 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:40,922 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,923 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:40,923 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,924 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:40,924 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,925 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:48:40,925 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:40,931 INFO L588 ElimStorePlain]: treesize reduction 29, result has 9.4 percent of original size [2019-11-26 20:48:40,931 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:40,932 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-26 20:48:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:48:41,106 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:48:41,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:41,107 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:48:41,109 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,283 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:48:41,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:41,284 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:48:41,285 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,527 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-26 20:48:41,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:41,529 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:48:41,530 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,701 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:48:41,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:41,702 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:48:41,703 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:41,875 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:48:41,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:41,876 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:48:41,878 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,078 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:48:42,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:42,079 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:48:42,080 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,226 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-26 20:48:42,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:42,227 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:48:42,228 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,455 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-11-26 20:48:42,456 INFO L588 ElimStorePlain]: treesize reduction 77, result has 62.1 percent of original size [2019-11-26 20:48:42,457 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:48:42,457 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:261, output treesize:14 [2019-11-26 20:48:42,462 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:42,462 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,466 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:48:42,466 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-26 20:48:42,592 INFO L343 Elim1Store]: treesize reduction 13, result has 79.4 percent of original size [2019-11-26 20:48:42,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 61 [2019-11-26 20:48:42,593 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:48:42,626 INFO L588 ElimStorePlain]: treesize reduction 23, result has 54.9 percent of original size [2019-11-26 20:48:42,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,627 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 20:48:42,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:28 [2019-11-26 20:48:42,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:48:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:48:42,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:48:42,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2019-11-26 20:48:42,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254093088] [2019-11-26 20:48:42,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-26 20:48:42,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:48:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-26 20:48:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-11-26 20:48:42,775 INFO L87 Difference]: Start difference. First operand 333 states and 393 transitions. Second operand 24 states. [2019-11-26 20:49:23,164 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-26 20:49:34,432 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-11-26 20:49:36,144 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-11-26 20:49:37,453 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-11-26 20:50:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:50:31,542 INFO L93 Difference]: Finished difference Result 354 states and 411 transitions. [2019-11-26 20:50:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 20:50:31,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-11-26 20:50:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:50:31,544 INFO L225 Difference]: With dead ends: 354 [2019-11-26 20:50:31,544 INFO L226 Difference]: Without dead ends: 354 [2019-11-26 20:50:31,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-26 20:50:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-26 20:50:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 332. [2019-11-26 20:50:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-26 20:50:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 392 transitions. [2019-11-26 20:50:31,552 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 392 transitions. Word has length 64 [2019-11-26 20:50:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:50:31,552 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 392 transitions. [2019-11-26 20:50:31,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-26 20:50:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 392 transitions. [2019-11-26 20:50:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-26 20:50:31,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:50:31,554 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:50:31,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:50:31,758 INFO L410 AbstractCegarLoop]: === Iteration 29 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:50:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:50:31,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1152340356, now seen corresponding path program 1 times [2019-11-26 20:50:31,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:50:31,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732448659] [2019-11-26 20:50:31,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:50:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 20:50:32,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732448659] [2019-11-26 20:50:32,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:50:32,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-26 20:50:32,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720735564] [2019-11-26 20:50:32,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:50:32,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:50:32,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:50:32,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:50:32,035 INFO L87 Difference]: Start difference. First operand 332 states and 392 transitions. Second operand 11 states. [2019-11-26 20:50:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:50:33,045 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2019-11-26 20:50:33,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:50:33,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-26 20:50:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:50:33,048 INFO L225 Difference]: With dead ends: 369 [2019-11-26 20:50:33,048 INFO L226 Difference]: Without dead ends: 356 [2019-11-26 20:50:33,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-26 20:50:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-26 20:50:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 328. [2019-11-26 20:50:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-26 20:50:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2019-11-26 20:50:33,056 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 73 [2019-11-26 20:50:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:50:33,057 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2019-11-26 20:50:33,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:50:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2019-11-26 20:50:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 20:50:33,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:50:33,058 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:50:33,058 INFO L410 AbstractCegarLoop]: === Iteration 30 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:50:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:50:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash -169295363, now seen corresponding path program 1 times [2019-11-26 20:50:33,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:50:33,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835908033] [2019-11-26 20:50:33,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:50:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:34,320 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-11-26 20:50:34,553 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-11-26 20:50:34,779 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-11-26 20:50:35,132 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2019-11-26 20:50:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 20:50:35,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835908033] [2019-11-26 20:50:35,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931624762] [2019-11-26 20:50:35,176 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:50:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:35,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-26 20:50:35,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:50:35,459 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:50:35,459 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:35,464 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:35,464 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:50:35,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-26 20:50:35,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:35,565 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:50:35,565 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:35,569 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:35,569 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:50:35,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-26 20:50:35,748 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:50:35,748 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:35,754 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:35,754 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:50:35,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2019-11-26 20:50:35,980 INFO L343 Elim1Store]: treesize reduction 25, result has 74.7 percent of original size [2019-11-26 20:50:35,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 85 [2019-11-26 20:50:35,981 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:36,024 INFO L588 ElimStorePlain]: treesize reduction 35, result has 55.1 percent of original size [2019-11-26 20:50:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:36,025 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 20:50:36,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:43 [2019-11-26 20:50:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:36,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:36,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:36,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:36,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:36,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:36,398 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:50:36,398 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:36,409 INFO L588 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-26 20:50:36,410 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:50:36,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-26 20:50:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:50:36,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:50:36,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 45 [2019-11-26 20:50:36,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498323450] [2019-11-26 20:50:36,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-26 20:50:36,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:50:36,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-26 20:50:36,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1841, Unknown=0, NotChecked=0, Total=2070 [2019-11-26 20:50:36,468 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand 46 states. [2019-11-26 20:50:36,744 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-26 20:50:36,938 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-26 20:50:37,144 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-26 20:50:37,511 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-26 20:50:38,432 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-26 20:50:38,627 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-11-26 20:50:38,840 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-11-26 20:50:39,036 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-26 20:50:40,104 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2019-11-26 20:50:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:50:41,445 INFO L93 Difference]: Finished difference Result 355 states and 401 transitions. [2019-11-26 20:50:41,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-26 20:50:41,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-11-26 20:50:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:50:41,449 INFO L225 Difference]: With dead ends: 355 [2019-11-26 20:50:41,450 INFO L226 Difference]: Without dead ends: 355 [2019-11-26 20:50:41,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=751, Invalid=3941, Unknown=0, NotChecked=0, Total=4692 [2019-11-26 20:50:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-26 20:50:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 328. [2019-11-26 20:50:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-26 20:50:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 378 transitions. [2019-11-26 20:50:41,459 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 378 transitions. Word has length 65 [2019-11-26 20:50:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:50:41,459 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 378 transitions. [2019-11-26 20:50:41,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-26 20:50:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 378 transitions. [2019-11-26 20:50:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 20:50:41,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:50:41,460 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:50:41,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:50:41,664 INFO L410 AbstractCegarLoop]: === Iteration 31 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:50:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:50:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash 515916095, now seen corresponding path program 1 times [2019-11-26 20:50:41,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:50:41,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103779269] [2019-11-26 20:50:41,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:50:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:42,513 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 31 [2019-11-26 20:50:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:43,253 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 27 [2019-11-26 20:50:43,792 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 34 [2019-11-26 20:50:44,334 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 30 [2019-11-26 20:50:45,134 WARN L192 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 45 [2019-11-26 20:50:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 20:50:45,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103779269] [2019-11-26 20:50:45,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498006203] [2019-11-26 20:50:45,639 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:50:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:50:45,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-26 20:50:45,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:50:46,000 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-26 20:50:46,000 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:50:46,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:50:46,001 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,063 INFO L588 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-11-26 20:50:46,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:50:46,065 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:50:46,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:58 [2019-11-26 20:50:46,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:50:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:50:46,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:50:46,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:50:46,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:50:46,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:46,535 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:50:46,535 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:46,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:46,648 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:50:46,649 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,651 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:50:46,652 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,655 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:50:46,655 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,659 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:50:46,659 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,662 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:50:46,663 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,665 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:50:46,665 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:46,680 INFO L588 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-11-26 20:50:46,681 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:50:46,681 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:271, output treesize:7 [2019-11-26 20:50:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:50:46,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:47,173 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-26 20:50:47,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:47,174 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:50:47,176 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:47,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:47,416 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:50:47,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:47,417 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:50:47,419 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:47,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:47,663 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:50:47,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:47,664 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:50:47,666 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:47,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:47,915 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:50:47,916 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:47,917 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:50:47,918 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:47,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:48,170 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:50:48,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:48,171 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:50:48,173 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:48,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:48,420 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:50:48,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:48,421 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:50:48,423 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:48,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:48,646 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-26 20:50:48,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:48,647 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:50:48,648 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:49,056 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-11-26 20:50:49,056 INFO L588 ElimStorePlain]: treesize reduction 718, result has 26.5 percent of original size [2019-11-26 20:50:49,057 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:50:49,058 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:306, output treesize:89 [2019-11-26 20:50:49,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:49,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:49,196 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:50:49,197 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:49,224 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:49,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:49,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:49,260 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:50:49,261 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:49,284 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:49,285 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:50:49,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:23 [2019-11-26 20:50:49,333 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:50:49,334 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:49,338 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:50:49,338 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:50:49,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-26 20:50:49,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:49,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:49,680 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-26 20:50:49,681 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-26 20:50:49,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 30 treesize of output 140 [2019-11-26 20:50:49,682 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:49,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:50:49,891 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-26 20:50:49,892 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-26 20:50:49,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 30 treesize of output 140 [2019-11-26 20:50:49,893 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:50:50,034 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-11-26 20:50:50,034 INFO L588 ElimStorePlain]: treesize reduction 120, result has 39.7 percent of original size [2019-11-26 20:50:50,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,037 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-26 20:50:50,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:79 [2019-11-26 20:50:50,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:50:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:50:50,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:50:50,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 32 [2019-11-26 20:50:50,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145531308] [2019-11-26 20:50:50,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-26 20:50:50,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:50:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-26 20:50:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 20:50:50,326 INFO L87 Difference]: Start difference. First operand 328 states and 378 transitions. Second operand 33 states. [2019-11-26 20:50:50,551 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-11-26 20:50:50,950 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2019-11-26 20:50:51,301 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2019-11-26 20:50:51,752 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-26 20:50:52,865 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-11-26 20:50:53,234 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-11-26 20:50:53,710 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-11-26 20:50:54,005 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-26 20:50:54,384 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-11-26 20:50:54,663 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-11-26 20:50:54,915 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-11-26 20:50:55,652 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-11-26 20:50:55,945 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-11-26 20:50:56,393 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-11-26 20:50:56,658 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-11-26 20:50:57,350 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-11-26 20:50:57,855 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-26 20:50:58,349 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-26 20:50:58,641 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-11-26 20:50:59,116 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-26 20:50:59,452 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2019-11-26 20:50:59,799 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2019-11-26 20:51:00,263 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 111 [2019-11-26 20:51:00,589 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-11-26 20:51:00,972 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-11-26 20:51:01,282 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-11-26 20:51:01,728 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-11-26 20:51:02,034 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-11-26 20:51:03,541 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-11-26 20:51:04,039 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-11-26 20:51:05,750 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-11-26 20:51:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:06,725 INFO L93 Difference]: Finished difference Result 357 states and 402 transitions. [2019-11-26 20:51:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-26 20:51:06,726 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-11-26 20:51:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:06,728 INFO L225 Difference]: With dead ends: 357 [2019-11-26 20:51:06,728 INFO L226 Difference]: Without dead ends: 357 [2019-11-26 20:51:06,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=827, Invalid=4575, Unknown=0, NotChecked=0, Total=5402 [2019-11-26 20:51:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-26 20:51:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 332. [2019-11-26 20:51:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-26 20:51:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 382 transitions. [2019-11-26 20:51:06,736 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 382 transitions. Word has length 67 [2019-11-26 20:51:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:06,736 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 382 transitions. [2019-11-26 20:51:06,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-26 20:51:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 382 transitions. [2019-11-26 20:51:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-26 20:51:06,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:06,738 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:51:06,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 20:51:06,942 INFO L410 AbstractCegarLoop]: === Iteration 32 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:06,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:06,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1478886374, now seen corresponding path program 1 times [2019-11-26 20:51:06,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:51:06,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5315864] [2019-11-26 20:51:06,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:51:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:51:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:51:07,078 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-26 20:51:07,079 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 20:51:07,142 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-26 20:51:07,151 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:51:07,151 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:51:07,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 08:51:07 BoogieIcfgContainer [2019-11-26 20:51:07,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 20:51:07,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 20:51:07,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 20:51:07,214 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 20:51:07,215 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:31" (3/4) ... [2019-11-26 20:51:07,225 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 20:51:07,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 20:51:07,226 INFO L168 Benchmark]: Toolchain (without parser) took 517781.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 952.3 MB in the beginning and 920.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 355.1 MB. Max. memory is 11.5 GB. [2019-11-26 20:51:07,227 INFO L168 Benchmark]: CDTParser took 0.20 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:51:07,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-26 20:51:07,229 INFO L168 Benchmark]: Boogie Preprocessor took 90.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:51:07,229 INFO L168 Benchmark]: RCFGBuilder took 804.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. [2019-11-26 20:51:07,229 INFO L168 Benchmark]: TraceAbstraction took 516178.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 920.1 MB in the end (delta: 132.0 MB). Peak memory consumption was 297.7 MB. Max. memory is 11.5 GB. [2019-11-26 20:51:07,230 INFO L168 Benchmark]: Witness Printer took 11.54 ms. Allocated memory is still 1.4 GB. Free memory is still 920.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:51:07,231 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.20 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 692.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 804.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 516178.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 920.1 MB in the end (delta: 132.0 MB). Peak memory consumption was 297.7 MB. Max. memory is 11.5 GB. * Witness Printer took 11.54 ms. Allocated memory is still 1.4 GB. Free memory is still 920.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [\old(commands)=null, \old(commands)=null, \old(global)=120, \old(global)=117, \old(state)=109, commands={7:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={4:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L722] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L723] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={9:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L723] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L724] CALL parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={10:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].state_needed=0, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L695] CALL commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L702] char *x = (char *)malloc(sizeof(char)); VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L703] COND FALSE !(!x) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, malloc(sizeof(char))={1:0}, state=1, x={1:0}] [L695] RET commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={1:0}, i=0, input={10:0}, input={10:0}, state=1] [L724] RET parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, state=1] [L725] return 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, \result=0, commands={7:0}, global={1:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 79 locations, 20 error locations. Result: UNSAFE, OverallTime: 515.9s, OverallIterations: 32, TraceHistogramMax: 5, AutomataDifference: 435.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1567 SDtfs, 10346 SDslu, 2804 SDs, 0 SdLazy, 15910 SolverSat, 3901 SolverUnsat, 88 SolverUnknown, 0 SolverNotchecked, 201.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1498 GetRequests, 790 SyntacticMatches, 83 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6502 ImplicationChecksByTransitivity, 152.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 880 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 72.2s InterpolantComputationTime, 1977 NumberOfCodeBlocks, 1977 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1853 ConstructedInterpolants, 250 QuantifiedInterpolants, 1750916 SizeOfPredicates, 206 NumberOfNonLiveVariables, 6738 ConjunctsInSsa, 542 ConjunctsInUnsatCore, 49 InterpolantComputations, 13 PerfectInterpolantSequences, 541/983 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-5758efa [2019-11-26 20:51:09,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:51:09,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:51:09,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:51:09,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:51:09,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:51:09,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:51:09,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:51:09,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:51:09,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:51:09,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:51:09,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:51:09,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:51:09,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:51:09,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:51:09,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:51:09,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:51:09,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:51:09,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:51:09,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:51:09,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:51:09,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:51:09,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:51:09,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:51:09,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:51:09,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:51:09,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:51:09,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:51:09,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:51:09,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:51:09,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:51:09,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:51:09,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:51:09,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:51:09,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:51:09,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:51:09,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:51:09,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:51:09,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:51:09,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:51:09,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:51:09,319 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:51:09,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:51:09,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:51:09,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:51:09,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:51:09,346 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:51:09,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:51:09,346 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 20:51:09,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:51:09,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:51:09,347 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 20:51:09,347 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 20:51:09,348 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 20:51:09,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:51:09,348 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 20:51:09,348 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 20:51:09,349 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 20:51:09,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:51:09,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:51:09,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:51:09,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:51:09,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:51:09,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:51:09,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:51:09,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:51:09,351 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 20:51:09,352 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 20:51:09,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 20:51:09,352 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-26 20:51:09,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:51:09,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:51:09,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:51:09,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:51:09,661 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:51:09,662 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-26 20:51:09,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74770909/9cded23936b24d3193468e2b3459cb56/FLAG7233d08c6 [2019-11-26 20:51:10,243 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:51:10,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-26 20:51:10,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74770909/9cded23936b24d3193468e2b3459cb56/FLAG7233d08c6 [2019-11-26 20:51:10,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74770909/9cded23936b24d3193468e2b3459cb56 [2019-11-26 20:51:10,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:51:10,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 20:51:10,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:51:10,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:51:10,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:51:10,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:51:10" (1/1) ... [2019-11-26 20:51:10,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:10, skipping insertion in model container [2019-11-26 20:51:10,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:51:10" (1/1) ... [2019-11-26 20:51:10,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:51:10,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:51:11,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:51:11,081 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 20:51:11,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:51:11,252 INFO L208 MainTranslator]: Completed translation [2019-11-26 20:51:11,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11 WrapperNode [2019-11-26 20:51:11,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:51:11,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 20:51:11,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 20:51:11,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 20:51:11,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (1/1) ... [2019-11-26 20:51:11,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (1/1) ... [2019-11-26 20:51:11,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (1/1) ... [2019-11-26 20:51:11,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (1/1) ... [2019-11-26 20:51:11,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (1/1) ... [2019-11-26 20:51:11,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (1/1) ... [2019-11-26 20:51:11,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (1/1) ... [2019-11-26 20:51:11,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 20:51:11,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 20:51:11,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 20:51:11,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 20:51:11,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (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:51:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 20:51:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 20:51:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-26 20:51:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 20:51:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 20:51:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 20:51:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-26 20:51:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-26 20:51:11,410 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-26 20:51:11,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 20:51:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 20:51:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 20:51:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 20:51:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 20:51:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 20:51:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 20:51:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 20:51:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 20:51:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 20:51:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 20:51:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 20:51:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 20:51:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 20:51:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 20:51:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 20:51:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 20:51:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 20:51:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 20:51:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 20:51:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 20:51:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 20:51:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 20:51:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 20:51:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 20:51:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 20:51:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 20:51:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 20:51:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 20:51:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 20:51:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 20:51:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 20:51:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 20:51:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 20:51:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 20:51:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 20:51:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 20:51:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 20:51:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 20:51:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 20:51:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 20:51:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 20:51:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 20:51:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 20:51:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 20:51:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 20:51:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 20:51:11,420 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 20:51:11,420 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 20:51:11,420 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 20:51:11,420 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-26 20:51:11,420 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 20:51:11,421 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 20:51:11,421 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 20:51:11,421 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 20:51:11,421 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 20:51:11,421 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 20:51:11,422 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 20:51:11,422 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 20:51:11,422 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 20:51:11,422 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 20:51:11,422 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 20:51:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 20:51:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 20:51:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 20:51:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 20:51:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 20:51:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 20:51:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 20:51:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 20:51:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 20:51:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 20:51:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 20:51:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 20:51:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 20:51:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 20:51:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 20:51:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 20:51:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 20:51:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 20:51:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 20:51:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 20:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 20:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 20:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 20:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 20:51:11,427 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 20:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 20:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 20:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 20:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 20:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 20:51:11,428 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 20:51:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 20:51:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 20:51:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 20:51:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 20:51:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 20:51:11,430 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 20:51:11,430 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 20:51:11,430 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-26 20:51:11,430 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-26 20:51:11,430 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 20:51:11,431 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-26 20:51:11,431 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-26 20:51:11,431 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-26 20:51:11,431 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-26 20:51:11,431 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-26 20:51:11,432 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-26 20:51:11,432 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-26 20:51:11,432 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-26 20:51:11,432 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-26 20:51:11,432 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-26 20:51:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-26 20:51:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-26 20:51:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-26 20:51:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-26 20:51:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-26 20:51:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-26 20:51:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-26 20:51:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-26 20:51:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-26 20:51:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-26 20:51:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-26 20:51:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-26 20:51:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-26 20:51:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-26 20:51:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-26 20:51:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-26 20:51:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-26 20:51:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-26 20:51:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-26 20:51:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-26 20:51:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-26 20:51:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-26 20:51:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-26 20:51:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-26 20:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-26 20:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-26 20:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-26 20:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-26 20:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-26 20:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-26 20:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-26 20:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-26 20:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-26 20:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-26 20:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-26 20:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 20:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-26 20:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-26 20:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 20:51:11,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-26 20:51:11,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 20:51:11,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 20:51:11,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 20:51:11,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 20:51:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-26 20:51:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 20:51:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 20:51:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 20:51:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 20:51:11,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-26 20:51:12,328 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 20:51:12,328 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 20:51:12,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:51:12 BoogieIcfgContainer [2019-11-26 20:51:12,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 20:51:12,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 20:51:12,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 20:51:12,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 20:51:12,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 08:51:10" (1/3) ... [2019-11-26 20:51:12,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd2b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:51:12, skipping insertion in model container [2019-11-26 20:51:12,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:51:11" (2/3) ... [2019-11-26 20:51:12,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd2b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:51:12, skipping insertion in model container [2019-11-26 20:51:12,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:51:12" (3/3) ... [2019-11-26 20:51:12,338 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-26 20:51:12,348 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 20:51:12,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-26 20:51:12,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-26 20:51:12,387 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 20:51:12,388 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 20:51:12,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 20:51:12,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 20:51:12,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 20:51:12,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 20:51:12,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 20:51:12,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 20:51:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-26 20:51:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:51:12,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:12,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:51:12,420 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:12,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-26 20:51:12,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:12,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446117234] [2019-11-26 20:51:12,441 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:51:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:12,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 20:51:12,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:13,086 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-26 20:51:13,089 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:51:13,090 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:51:13,092 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:13,178 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-26 20:51:13,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:13,189 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:51:13,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-26 20:51:13,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:13,231 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:51:13,231 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:51:13,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446117234] [2019-11-26 20:51:13,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:13,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 20:51:13,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267509350] [2019-11-26 20:51:13,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:51:13,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:13,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:51:13,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:51:13,307 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-26 20:51:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:13,498 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-11-26 20:51:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:51:13,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 20:51:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:13,513 INFO L225 Difference]: With dead ends: 93 [2019-11-26 20:51:13,514 INFO L226 Difference]: Without dead ends: 87 [2019-11-26 20:51:13,516 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:51:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-26 20:51:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-26 20:51:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-26 20:51:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-11-26 20:51:13,572 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 9 [2019-11-26 20:51:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:13,572 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-11-26 20:51:13,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:51:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-11-26 20:51:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:51:13,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:13,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:51:13,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 20:51:13,783 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:13,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-26 20:51:13,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:13,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035626927] [2019-11-26 20:51:13,790 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:51:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:14,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 20:51:14,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:14,389 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:51:14,391 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:51:14,392 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:51:14,393 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:14,541 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-26 20:51:14,542 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-26 20:51:14,548 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:51:14,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-26 20:51:14,595 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:51:14,596 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:14,829 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:51:14,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035626927] [2019-11-26 20:51:14,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:14,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 20:51:14,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544647218] [2019-11-26 20:51:14,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:51:14,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:51:14,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:51:14,833 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 6 states. [2019-11-26 20:51:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:15,396 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2019-11-26 20:51:15,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:51:15,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-26 20:51:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:15,401 INFO L225 Difference]: With dead ends: 172 [2019-11-26 20:51:15,402 INFO L226 Difference]: Without dead ends: 172 [2019-11-26 20:51:15,403 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:51:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-26 20:51:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2019-11-26 20:51:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-26 20:51:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-11-26 20:51:15,433 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 9 [2019-11-26 20:51:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:15,434 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-11-26 20:51:15,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:51:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-11-26 20:51:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 20:51:15,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:15,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:51:15,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 20:51:15,639 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-26 20:51:15,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:15,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767207821] [2019-11-26 20:51:15,641 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:51:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:15,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 20:51:15,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:15,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:15,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:16,163 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2019-11-26 20:51:16,164 INFO L343 Elim1Store]: treesize reduction 360, result has 17.4 percent of original size [2019-11-26 20:51:16,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, 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:51:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:16,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:16,169 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:16,427 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-11-26 20:51:16,428 INFO L588 ElimStorePlain]: treesize reduction 181, result has 40.3 percent of original size [2019-11-26 20:51:16,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:16,439 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:51:16,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:99, output treesize:122 [2019-11-26 20:51:16,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:16,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:16,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:16,700 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:51:16,701 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:16,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:16,769 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:51:16,770 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:16,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:16,829 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:51:16,829 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:16,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:16,887 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:51:16,887 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:16,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:16,953 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:51:16,953 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:17,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:17,004 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:51:17,005 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:17,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:17,045 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:51:17,046 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:17,673 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:51:17,676 INFO L588 ElimStorePlain]: treesize reduction 279, result has 61.8 percent of original size [2019-11-26 20:51:17,681 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:51:17,682 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:730, output treesize:451 [2019-11-26 20:51:17,954 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:51:17,955 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:17,995 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:17,996 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:51:17,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:56 [2019-11-26 20:51:18,046 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:51:18,046 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:18,393 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:51:18,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767207821] [2019-11-26 20:51:18,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:18,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:51:18,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236065134] [2019-11-26 20:51:18,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:51:18,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:51:18,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:51:18,395 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 9 states. [2019-11-26 20:51:19,187 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-11-26 20:51:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:20,354 INFO L93 Difference]: Finished difference Result 260 states and 372 transitions. [2019-11-26 20:51:20,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:51:20,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-26 20:51:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:20,360 INFO L225 Difference]: With dead ends: 260 [2019-11-26 20:51:20,360 INFO L226 Difference]: Without dead ends: 260 [2019-11-26 20:51:20,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:51:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-26 20:51:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 213. [2019-11-26 20:51:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-26 20:51:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2019-11-26 20:51:20,392 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 10 [2019-11-26 20:51:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:20,393 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2019-11-26 20:51:20,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:51:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2019-11-26 20:51:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 20:51:20,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:20,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:51:20,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 20:51:20,599 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-26 20:51:20,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:20,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502601479] [2019-11-26 20:51:20,602 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:51:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:20,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-26 20:51:20,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:20,852 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_52|], 8=[|v_#valid_69|]} [2019-11-26 20:51:20,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:20,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:20,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:20,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:20,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:20,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:20,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:21,176 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-11-26 20:51:21,178 INFO L343 Elim1Store]: treesize reduction 48, result has 70.0 percent of original size [2019-11-26 20:51:21,178 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:51:21,179 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:21,418 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:51:21,419 INFO L588 ElimStorePlain]: treesize reduction 58, result has 70.1 percent of original size [2019-11-26 20:51:21,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:21,482 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:51:21,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,489 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:21,803 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-11-26 20:51:21,804 INFO L588 ElimStorePlain]: treesize reduction 496, result has 20.1 percent of original size [2019-11-26 20:51:21,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,812 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:51:21,812 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:103, output treesize:125 [2019-11-26 20:51:21,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,988 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-26 20:51:21,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:21,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:22,091 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:51:22,092 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:22,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:22,108 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:51:22,108 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:22,122 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:22,123 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:51:22,124 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:22,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:22,149 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:51:22,149 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:22,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:22,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:22,169 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:51:22,169 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:22,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:22,185 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:51:22,185 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:22,534 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-26 20:51:22,535 INFO L588 ElimStorePlain]: treesize reduction 211, result has 51.3 percent of original size [2019-11-26 20:51:22,538 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:51:22,539 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:515, output treesize:222 [2019-11-26 20:51:22,760 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-11-26 20:51:22,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:22,959 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:51:22,959 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:23,058 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:23,067 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:51:23,069 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:23,172 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-26 20:51:23,173 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:23,183 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:51:23,184 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:23,262 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:23,271 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:51:23,272 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:23,335 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:23,336 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:51:23,336 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:138, output treesize:83 [2019-11-26 20:51:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:51:23,397 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:23,714 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:51:23,874 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:51:23,988 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:51:24,116 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 20:51:24,159 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:51:24,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502601479] [2019-11-26 20:51:24,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:24,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:51:24,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98784159] [2019-11-26 20:51:24,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:51:24,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:51:24,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:51:24,161 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand 9 states. [2019-11-26 20:51:24,473 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-11-26 20:51:24,776 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2019-11-26 20:51:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:26,161 INFO L93 Difference]: Finished difference Result 394 states and 571 transitions. [2019-11-26 20:51:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 20:51:26,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-26 20:51:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:26,168 INFO L225 Difference]: With dead ends: 394 [2019-11-26 20:51:26,168 INFO L226 Difference]: Without dead ends: 394 [2019-11-26 20:51:26,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:51:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-26 20:51:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 319. [2019-11-26 20:51:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-26 20:51:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 505 transitions. [2019-11-26 20:51:26,238 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 505 transitions. Word has length 11 [2019-11-26 20:51:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:26,240 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 505 transitions. [2019-11-26 20:51:26,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:51:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 505 transitions. [2019-11-26 20:51:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 20:51:26,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:26,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:51:26,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 20:51:26,467 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-26 20:51:26,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:26,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596439762] [2019-11-26 20:51:26,469 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:51:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:26,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 20:51:26,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:26,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:26,942 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-11-26 20:51:26,943 INFO L343 Elim1Store]: treesize reduction 336, result has 15.2 percent of original size [2019-11-26 20:51:26,944 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:51:26,945 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:27,106 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-11-26 20:51:27,107 INFO L588 ElimStorePlain]: treesize reduction 49, result has 62.9 percent of original size [2019-11-26 20:51:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:27,111 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:51:27,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:83 [2019-11-26 20:51:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:27,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:27,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:27,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:27,466 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:51:27,466 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:27,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:27,483 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:51:27,484 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:27,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:27,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:27,493 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:51:27,494 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:27,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:27,520 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:51:27,521 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:27,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:27,542 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:51:27,543 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:27,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:27,560 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:51:27,561 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:27,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:27,579 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:51:27,580 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:28,009 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-26 20:51:28,010 INFO L588 ElimStorePlain]: treesize reduction 100, result has 76.8 percent of original size [2019-11-26 20:51:28,014 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:51:28,014 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:478, output treesize:331 [2019-11-26 20:51:28,185 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:51:28,185 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:28,454 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:51:28,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596439762] [2019-11-26 20:51:28,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:28,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:51:28,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058721980] [2019-11-26 20:51:28,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:51:28,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:51:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:51:28,456 INFO L87 Difference]: Start difference. First operand 319 states and 505 transitions. Second operand 9 states. [2019-11-26 20:51:31,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:31,792 INFO L93 Difference]: Finished difference Result 411 states and 618 transitions. [2019-11-26 20:51:31,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:51:31,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-11-26 20:51:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:31,801 INFO L225 Difference]: With dead ends: 411 [2019-11-26 20:51:31,801 INFO L226 Difference]: Without dead ends: 411 [2019-11-26 20:51:31,802 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:51:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-26 20:51:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 363. [2019-11-26 20:51:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-26 20:51:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 569 transitions. [2019-11-26 20:51:31,843 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 569 transitions. Word has length 12 [2019-11-26 20:51:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:31,843 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 569 transitions. [2019-11-26 20:51:31,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:51:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 569 transitions. [2019-11-26 20:51:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 20:51:31,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:31,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:51:32,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 20:51:32,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-26 20:51:32,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:32,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667375543] [2019-11-26 20:51:32,067 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:51:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:32,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 20:51:32,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:32,247 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_65|], 4=[|v_#valid_85|]} [2019-11-26 20:51:32,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:32,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:32,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:32,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:32,536 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-26 20:51:32,536 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-26 20:51:32,537 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:51:32,537 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:32,707 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-26 20:51:32,708 INFO L588 ElimStorePlain]: treesize reduction 50, result has 64.0 percent of original size [2019-11-26 20:51:32,725 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:51:32,726 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:32,907 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-26 20:51:32,908 INFO L588 ElimStorePlain]: treesize reduction 64, result has 56.8 percent of original size [2019-11-26 20:51:32,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,929 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:51:32,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:60, output treesize:84 [2019-11-26 20:51:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:32,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:33,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:33,170 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:51:33,171 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:33,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:33,212 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:51:33,212 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:33,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:33,245 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:51:33,245 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:33,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:33,270 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:51:33,271 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,280 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:33,280 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:33,302 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:51:33,303 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,312 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:33,312 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,326 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:51:33,326 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,334 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:33,335 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:33,353 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:51:33,353 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,366 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:33,366 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,386 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:51:33,386 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,395 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:33,395 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,411 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,416 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:51:33,416 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,435 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:51:33,436 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,449 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:51:33,450 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,456 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:33,456 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:33,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:33,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:33,477 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:51:33,477 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:33,842 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-11-26 20:51:33,843 INFO L588 ElimStorePlain]: treesize reduction 321, result has 39.7 percent of original size [2019-11-26 20:51:33,844 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:51:33,844 INFO L221 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:1046, output treesize:211 [2019-11-26 20:51:34,029 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:51:34,029 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:34,277 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:51:34,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667375543] [2019-11-26 20:51:34,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:34,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-26 20:51:34,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315864049] [2019-11-26 20:51:34,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:51:34,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:51:34,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:51:34,279 INFO L87 Difference]: Start difference. First operand 363 states and 569 transitions. Second operand 9 states. [2019-11-26 20:51:34,546 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-26 20:51:34,791 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-11-26 20:51:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:36,233 INFO L93 Difference]: Finished difference Result 425 states and 598 transitions. [2019-11-26 20:51:36,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:51:36,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-26 20:51:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:36,237 INFO L225 Difference]: With dead ends: 425 [2019-11-26 20:51:36,237 INFO L226 Difference]: Without dead ends: 425 [2019-11-26 20:51:36,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-26 20:51:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-26 20:51:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 367. [2019-11-26 20:51:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-26 20:51:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 569 transitions. [2019-11-26 20:51:36,257 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 569 transitions. Word has length 13 [2019-11-26 20:51:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:36,257 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 569 transitions. [2019-11-26 20:51:36,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:51:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 569 transitions. [2019-11-26 20:51:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 20:51:36,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:36,259 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:51:36,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 20:51:36,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2063492765, now seen corresponding path program 1 times [2019-11-26 20:51:36,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:36,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32085700] [2019-11-26 20:51:36,475 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:51:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:36,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 20:51:36,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:36,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:36,985 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:51:36,986 INFO L343 Elim1Store]: treesize reduction 429, result has 15.7 percent of original size [2019-11-26 20:51:36,986 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:51:36,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:36,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:36,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:36,989 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:37,357 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-11-26 20:51:37,359 INFO L588 ElimStorePlain]: treesize reduction 515, result has 19.9 percent of original size [2019-11-26 20:51:37,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:37,364 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:51:37,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:102, output treesize:128 [2019-11-26 20:51:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:37,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:37,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:37,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:37,530 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:51:37,530 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:37,541 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:37,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:37,543 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:51:37,543 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:37,569 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:37,569 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:51:37,570 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:37,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:37,597 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:51:37,597 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:37,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:37,666 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:51:37,667 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:37,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:37,695 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:51:37,695 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:37,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:37,712 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:51:37,712 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:38,351 WARN L192 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-26 20:51:38,352 INFO L588 ElimStorePlain]: treesize reduction 225, result has 67.7 percent of original size [2019-11-26 20:51:38,355 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:51:38,356 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:760, output treesize:471 [2019-11-26 20:51:38,519 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 46 [2019-11-26 20:51:38,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, 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:51:38,714 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:38,769 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:38,770 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:51:38,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:63 [2019-11-26 20:51:38,835 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:51:38,835 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:39,387 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:51:39,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32085700] [2019-11-26 20:51:39,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:51:39,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-26 20:51:39,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713627463] [2019-11-26 20:51:39,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:51:39,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:51:39,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:51:39,389 INFO L87 Difference]: Start difference. First operand 367 states and 569 transitions. Second operand 11 states. [2019-11-26 20:51:39,738 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-11-26 20:51:40,286 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-11-26 20:51:40,801 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-11-26 20:51:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:42,225 INFO L93 Difference]: Finished difference Result 478 states and 729 transitions. [2019-11-26 20:51:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:51:42,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-26 20:51:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:42,230 INFO L225 Difference]: With dead ends: 478 [2019-11-26 20:51:42,230 INFO L226 Difference]: Without dead ends: 478 [2019-11-26 20:51:42,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:51:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-26 20:51:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 386. [2019-11-26 20:51:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-26 20:51:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 599 transitions. [2019-11-26 20:51:42,248 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 599 transitions. Word has length 18 [2019-11-26 20:51:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:42,249 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 599 transitions. [2019-11-26 20:51:42,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:51:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 599 transitions. [2019-11-26 20:51:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 20:51:42,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:42,250 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:51:42,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 20:51:42,471 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:42,471 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-26 20:51:42,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:42,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511666793] [2019-11-26 20:51:42,472 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:51:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:42,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 20:51:42,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:42,731 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_78|], 9=[|v_#valid_101|]} [2019-11-26 20:51:42,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:42,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:42,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:42,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:42,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:42,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:42,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:43,068 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-26 20:51:43,069 INFO L343 Elim1Store]: treesize reduction 63, result has 65.6 percent of original size [2019-11-26 20:51:43,070 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:51:43,070 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:43,315 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-26 20:51:43,315 INFO L588 ElimStorePlain]: treesize reduction 62, result has 70.9 percent of original size [2019-11-26 20:51:43,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:43,357 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:51:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,361 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:43,673 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-26 20:51:43,673 INFO L588 ElimStorePlain]: treesize reduction 171, result has 45.2 percent of original size [2019-11-26 20:51:43,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,682 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:51:43,682 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:141 [2019-11-26 20:51:43,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:43,946 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:43,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:43,959 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:51:43,959 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:43,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:43,984 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:51:43,984 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,009 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:51:44,009 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:44,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:44,033 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:51:44,034 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:44,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:44,080 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:51:44,080 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:44,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:44,100 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:51:44,100 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:44,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:44,120 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:51:44,120 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:44,140 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:51:44,140 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,149 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:44,149 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,158 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:44,158 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,166 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:51:44,166 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:44,583 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-11-26 20:51:44,584 INFO L588 ElimStorePlain]: treesize reduction 441, result has 37.4 percent of original size [2019-11-26 20:51:44,586 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:51:44,586 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:1266, output treesize:263 [2019-11-26 20:51:44,753 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-11-26 20:51:45,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:51:45,085 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:51:45,086 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:45,161 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:45,168 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:51:45,168 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:45,242 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:45,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 15 treesize of output 7 [2019-11-26 20:51:45,250 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:45,317 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:45,325 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:51:45,326 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:45,384 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:45,385 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:51:45,386 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:128, output treesize:75 [2019-11-26 20:51:45,463 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:51:45,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:45,989 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-26 20:51:46,031 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:51:46,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511666793] [2019-11-26 20:51:46,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:51:46,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-26 20:51:46,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481352562] [2019-11-26 20:51:46,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:51:46,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:51:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:51:46,033 INFO L87 Difference]: Start difference. First operand 386 states and 599 transitions. Second operand 11 states. [2019-11-26 20:51:46,548 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-11-26 20:51:46,899 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-11-26 20:51:47,217 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-11-26 20:51:47,631 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-11-26 20:51:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:50,609 INFO L93 Difference]: Finished difference Result 519 states and 763 transitions. [2019-11-26 20:51:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 20:51:50,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-26 20:51:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:50,614 INFO L225 Difference]: With dead ends: 519 [2019-11-26 20:51:50,614 INFO L226 Difference]: Without dead ends: 519 [2019-11-26 20:51:50,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:51:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-11-26 20:51:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 424. [2019-11-26 20:51:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-26 20:51:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 664 transitions. [2019-11-26 20:51:50,635 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 664 transitions. Word has length 19 [2019-11-26 20:51:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:50,635 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 664 transitions. [2019-11-26 20:51:50,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:51:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 664 transitions. [2019-11-26 20:51:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 20:51:50,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:50,637 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:51:50,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 20:51:50,849 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1646608229, now seen corresponding path program 1 times [2019-11-26 20:51:50,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:50,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998110073] [2019-11-26 20:51:50,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 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:51:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:51,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 20:51:51,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:51,024 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:51:51,024 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:51,034 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:51:51,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998110073] [2019-11-26 20:51:51,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:51,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 20:51:51,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622393246] [2019-11-26 20:51:51,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:51:51,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:51,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:51:51,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:51:51,035 INFO L87 Difference]: Start difference. First operand 424 states and 664 transitions. Second operand 3 states. [2019-11-26 20:51:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:51,041 INFO L93 Difference]: Finished difference Result 325 states and 478 transitions. [2019-11-26 20:51:51,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:51:51,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 20:51:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:51,044 INFO L225 Difference]: With dead ends: 325 [2019-11-26 20:51:51,044 INFO L226 Difference]: Without dead ends: 325 [2019-11-26 20:51:51,044 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:51:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-26 20:51:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2019-11-26 20:51:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-26 20:51:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 469 transitions. [2019-11-26 20:51:51,056 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 469 transitions. Word has length 23 [2019-11-26 20:51:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:51,057 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 469 transitions. [2019-11-26 20:51:51,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:51:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 469 transitions. [2019-11-26 20:51:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 20:51:51,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:51,058 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:51:51,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 20:51:51,279 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash -407602741, now seen corresponding path program 1 times [2019-11-26 20:51:51,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:51,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843150644] [2019-11-26 20:51:51,299 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:51:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:51,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 20:51:51,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:51,491 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:51:51,491 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:51,532 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:51:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843150644] [2019-11-26 20:51:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 20:51:51,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367913647] [2019-11-26 20:51:51,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:51:51,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:51:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:51:51,534 INFO L87 Difference]: Start difference. First operand 320 states and 469 transitions. Second operand 3 states. [2019-11-26 20:51:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:51,557 INFO L93 Difference]: Finished difference Result 362 states and 510 transitions. [2019-11-26 20:51:51,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:51:51,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 20:51:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:51,560 INFO L225 Difference]: With dead ends: 362 [2019-11-26 20:51:51,560 INFO L226 Difference]: Without dead ends: 362 [2019-11-26 20:51:51,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:51:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-26 20:51:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 348. [2019-11-26 20:51:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-26 20:51:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 501 transitions. [2019-11-26 20:51:51,573 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 501 transitions. Word has length 24 [2019-11-26 20:51:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:51,573 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 501 transitions. [2019-11-26 20:51:51,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:51:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 501 transitions. [2019-11-26 20:51:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 20:51:51,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:51,575 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:51:51,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 20:51:51,795 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:51,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-26 20:51:51,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:51,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135906922] [2019-11-26 20:51:51,797 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:51:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:51,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 20:51:51,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:51,972 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:51:51,973 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:52,024 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:51:52,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135906922] [2019-11-26 20:51:52,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:51:52,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-26 20:51:52,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227054820] [2019-11-26 20:51:52,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:51:52,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:51:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:51:52,026 INFO L87 Difference]: Start difference. First operand 348 states and 501 transitions. Second operand 8 states. [2019-11-26 20:51:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:52,228 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2019-11-26 20:51:52,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:51:52,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-26 20:51:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:52,231 INFO L225 Difference]: With dead ends: 365 [2019-11-26 20:51:52,232 INFO L226 Difference]: Without dead ends: 365 [2019-11-26 20:51:52,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:51:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-26 20:51:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-11-26 20:51:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-26 20:51:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 421 transitions. [2019-11-26 20:51:52,247 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 421 transitions. Word has length 25 [2019-11-26 20:51:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:52,248 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 421 transitions. [2019-11-26 20:51:52,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:51:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 421 transitions. [2019-11-26 20:51:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:51:52,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:52,250 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:51:52,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 20:51:52,462 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:52,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2031405767, now seen corresponding path program 1 times [2019-11-26 20:51:52,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:52,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499422738] [2019-11-26 20:51:52,463 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:51:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:52,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 20:51:52,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:52,717 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:51:52,718 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:52,758 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:51:52,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499422738] [2019-11-26 20:51:52,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:51:52,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 20:51:52,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100702725] [2019-11-26 20:51:52,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:51:52,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:52,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:51:52,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:51:52,760 INFO L87 Difference]: Start difference. First operand 315 states and 421 transitions. Second operand 3 states. [2019-11-26 20:51:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:51:52,769 INFO L93 Difference]: Finished difference Result 229 states and 292 transitions. [2019-11-26 20:51:52,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:51:52,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-26 20:51:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:51:52,772 INFO L225 Difference]: With dead ends: 229 [2019-11-26 20:51:52,772 INFO L226 Difference]: Without dead ends: 229 [2019-11-26 20:51:52,772 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:51:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-26 20:51:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-11-26 20:51:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-26 20:51:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2019-11-26 20:51:52,782 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 33 [2019-11-26 20:51:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:51:52,783 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2019-11-26 20:51:52,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:51:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2019-11-26 20:51:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 20:51:52,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:51:52,790 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:51:53,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 20:51:53,013 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:51:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:51:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-26 20:51:53,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:51:53,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611617226] [2019-11-26 20:51:53,014 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:51:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:51:53,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 20:51:53,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:51:53,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:51:53,484 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-11-26 20:51:53,484 INFO L343 Elim1Store]: treesize reduction 339, result has 15.0 percent of original size [2019-11-26 20:51:53,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, 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:51:53,485 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:53,588 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-26 20:51:53,589 INFO L588 ElimStorePlain]: treesize reduction 10, result has 87.7 percent of original size [2019-11-26 20:51:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:53,591 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:51:53,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:71 [2019-11-26 20:51:53,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:53,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:51:53,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:53,771 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:51:53,772 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:53,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:53,789 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:51:53,789 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:53,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:53,807 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:51:53,808 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:53,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:53,825 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:51:53,826 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:53,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:53,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:51:53,844 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:53,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:53,861 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:51:53,861 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 20:51:53,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:51:53,869 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:51:53,869 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:54,182 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-26 20:51:54,183 INFO L588 ElimStorePlain]: treesize reduction 88, result has 74.6 percent of original size [2019-11-26 20:51:54,184 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:51:54,185 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:394, output treesize:259 [2019-11-26 20:51:54,280 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:51:54,281 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:51:54,288 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:51:54,289 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:51:54,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2019-11-26 20:51:54,356 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:51:54,356 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:51:54,568 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:51:54,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611617226] [2019-11-26 20:51:54,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:51:54,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-26 20:51:54,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118558877] [2019-11-26 20:51:54,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:51:54,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:51:54,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:51:54,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:51:54,570 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand 11 states. [2019-11-26 20:52:04,539 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-26 20:52:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:52:22,388 INFO L93 Difference]: Finished difference Result 325 states and 387 transitions. [2019-11-26 20:52:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:52:22,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-11-26 20:52:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:52:22,391 INFO L225 Difference]: With dead ends: 325 [2019-11-26 20:52:22,391 INFO L226 Difference]: Without dead ends: 319 [2019-11-26 20:52:22,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:52:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-26 20:52:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 282. [2019-11-26 20:52:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-26 20:52:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 358 transitions. [2019-11-26 20:52:22,401 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 358 transitions. Word has length 33 [2019-11-26 20:52:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:52:22,401 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 358 transitions. [2019-11-26 20:52:22,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:52:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2019-11-26 20:52:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 20:52:22,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:52:22,408 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:52:22,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 20:52:22,629 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 20:52:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:52:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash -330240892, now seen corresponding path program 1 times [2019-11-26 20:52:22,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:52:22,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462103768] [2019-11-26 20:52:22,632 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:52:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:52:22,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-26 20:52:22,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:52:23,206 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-26 20:52:23,206 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-26 20:52:23,207 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:52:23,207 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:23,397 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-26 20:52:23,397 INFO L588 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-26 20:52:23,704 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-26 20:52:23,705 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-26 20:52:23,705 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:52:23,706 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:23,926 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-26 20:52:23,926 INFO L588 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-26 20:52:23,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:23,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:52:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,944 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:52:23,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-26 20:52:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:52:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:52:24,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:52:24,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:52:24,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,189 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:52:24,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:52:24,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,333 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:52:24,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:52:24,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:52:24,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:52:24,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:52:24,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:24,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:24,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:24,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:24,543 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:52:24,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:24,750 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:52:24,751 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:24,936 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:24,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52: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:52:24,937 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:25,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:25,111 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:52:25,112 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:25,387 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:25,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:25,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 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:52:25,389 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:25,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:25,504 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:52:25,505 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:25,696 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:25,696 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52: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:52:25,697 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:25,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:25,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-26 20:52:25,808 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:25,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:25,866 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:52:25,867 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:25,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:25,975 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:52:25,976 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:26,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:26,012 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:52:26,013 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:26,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:26,140 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:52:26,141 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:26,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:26,202 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:52:26,203 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:26,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:26,377 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:52:26,379 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:26,565 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:26,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:26,566 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:52:26,567 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:26,831 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:26,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:26,832 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:52:26,833 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,002 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,002 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:52:27,003 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,187 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:27,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,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, 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:52:27,189 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,253 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:52:27,254 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,289 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:52:27,289 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,331 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:52:27,331 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,370 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:52:27,371 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,481 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:52:27,482 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,545 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:52:27,545 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,579 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:52:27,580 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,647 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:52:27,648 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,720 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,720 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:52:27,721 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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:52:27,764 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,795 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,830 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:52:27,830 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:27,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:27,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:27,870 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:52:27,870 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,141 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:28,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,143 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:52:28,144 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,179 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:52:28,179 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,214 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:52:28,215 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,400 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:52:28,401 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,424 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:52:28,424 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,545 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:52:28,546 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,658 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:52:28,658 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,774 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:52:28,775 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,799 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,811 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:52:28,812 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,846 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:52:28,846 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,871 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,914 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:52:28,915 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:28,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:28,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:28,949 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:52:28,949 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,125 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:52:29,126 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,237 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:52:29,238 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,413 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:52:29,414 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,521 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:52:29,521 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,545 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,546 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,558 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:52:29,558 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,734 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:52:29,735 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,802 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:52:29,802 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,834 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,841 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:52:29,842 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,908 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,909 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:52:29,909 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,942 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:52:29,942 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:29,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,971 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,972 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,976 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:29,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:29,983 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:52:29,984 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,009 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,023 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:52:30,024 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,052 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:52:30,052 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,079 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:52:30,079 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,109 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,128 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:52:30,128 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,208 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:52:30,209 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,240 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,254 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:52:30,255 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,331 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:52:30,332 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,368 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:52:30,369 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,395 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,396 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,397 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:52:30,397 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,427 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,511 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:52:30,512 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,538 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,547 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,583 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:52:30,583 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,621 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:52:30,621 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,688 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:52:30,689 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,721 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,740 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:52:30,741 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,772 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,783 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,784 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,797 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,797 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:52:30,797 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,836 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:52:30,836 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,889 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:52:30,890 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:30,938 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:52:30,939 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:30,978 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:30,983 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:52:30,983 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:31,036 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:52:31,036 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,065 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-26 20:52:31,066 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,097 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,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, 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:52:31,100 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,130 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,130 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,133 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:52:31,133 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,203 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:31,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, 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:52:31,204 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,232 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:52:31,233 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,274 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:31,274 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:52:31,275 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,304 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:31,318 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:52:31,319 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:31,362 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:52:31,363 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,389 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:52:31,389 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,412 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,413 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,416 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:52:31,416 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,442 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:52:31,442 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,468 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:52:31,468 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,489 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,489 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,512 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,512 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,534 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,534 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,556 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,557 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,581 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:31,595 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:52:31,596 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,620 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,620 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,646 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,646 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,669 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,669 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,716 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,717 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,732 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,732 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,748 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,749 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,766 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,769 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,770 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,780 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:31,781 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:52:31,781 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,799 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,800 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,815 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,816 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,834 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,835 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,835 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:31,836 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:52:31,837 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,852 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,852 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,866 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,866 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,884 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,884 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,900 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,900 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,915 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,915 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,931 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,931 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,948 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,948 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,964 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,964 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,980 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,980 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:31,998 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:31,998 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,033 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,034 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,052 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,052 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,069 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,070 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,088 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,088 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,120 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,120 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,135 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,136 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,151 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,173 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:52:32,174 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,190 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,190 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,206 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,206 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:32,239 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:52:32,239 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,255 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,255 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,270 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,271 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,287 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,287 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,302 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,302 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,317 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,317 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:32,348 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:52:32,348 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,362 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,363 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,380 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,380 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,402 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:52:32,403 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,420 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,420 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,442 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:52:32,442 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,457 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,458 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,472 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,473 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,489 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,489 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,505 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,505 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,521 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,521 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,537 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,537 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,555 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,555 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,570 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,570 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,586 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,586 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,603 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,603 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,617 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,617 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,633 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,633 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:52:32,654 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,669 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,669 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,689 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,691 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:52:32,691 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:52:32,692 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,706 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,706 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,720 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,721 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,736 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,737 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,750 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,750 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,764 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,764 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,778 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,778 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,796 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:52:32,797 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,812 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,813 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,826 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,826 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,841 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,842 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,856 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,857 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,871 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,871 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,885 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,885 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,897 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,897 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,911 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,911 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,925 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,925 INFO L508 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,940 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,940 INFO L508 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,953 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,953 INFO L508 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,968 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,968 INFO L508 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,981 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,982 INFO L508 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:32,996 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:32,997 INFO L508 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,016 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,016 INFO L508 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,029 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,030 INFO L508 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,044 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,044 INFO L508 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,058 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,058 INFO L508 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,070 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,070 INFO L508 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,083 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,084 INFO L508 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,097 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,097 INFO L508 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,111 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,111 INFO L508 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,125 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,125 INFO L508 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,137 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,137 INFO L508 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,151 INFO L508 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,165 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 20:52:33,166 INFO L508 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,387 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-26 20:52:33,388 INFO L588 ElimStorePlain]: treesize reduction 1999, result has 0.8 percent of original size [2019-11-26 20:52:33,390 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:52:33,391 INFO L508 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,397 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:33,397 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:52:33,397 INFO L221 ElimStorePlain]: Needed 181 recursive calls to eliminate 7 variables, input treesize:10867, output treesize:10 [2019-11-26 20:52:33,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:33,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:33,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 20:52:33,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-26 20:52:33,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:33,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-26 20:52:33,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:33,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:33,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:33,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-26 20:52:33,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:52:33,458 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-26 20:52:33,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,720 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:33,721 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:52:33,722 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:33,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:33,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:33,954 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:52:33,955 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:34,139 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:52:34,139 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:34,327 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:52:34,329 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:34,467 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:52:34,467 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:34,538 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:52:34,539 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:34,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 33 treesize of output 92 [2019-11-26 20:52:34,756 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:34,866 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:52:34,867 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:34,942 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:52:34,943 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:34,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:34,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:35,115 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:52:35,116 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:35,236 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:52:35,236 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,342 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:35,343 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:52:35,344 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:35,485 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:52:35,485 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:35,663 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:52:35,663 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:35,770 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:52:35,771 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:35,881 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:52:35,882 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,924 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:52:35,925 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:35,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:35,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,189 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:36,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:36,190 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:52:36,191 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:36,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:36,309 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:52:36,310 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:36,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:36,500 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:52:36,501 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:36,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,749 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:36,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:36,750 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:52:36,752 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:36,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:36,858 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:52:36,859 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:36,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:36,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:37,032 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:52:37,033 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:37,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:37,148 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:52:37,149 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:37,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,344 INFO L237 Elim1Store]: Index analysis took 163 ms [2019-11-26 20:52:37,536 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:37,536 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:37,536 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:52:37,538 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:37,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:37,653 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:52:37,653 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:37,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,838 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:37,839 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:52:37,840 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:37,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:37,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,019 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:52:38,021 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,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 26 treesize of output 58 [2019-11-26 20:52:38,154 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,271 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:52:38,272 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,389 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:52:38,389 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,453 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:52:38,453 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,640 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:52:38,640 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,765 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:52:38,766 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:38,944 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:52:38,946 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:38,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:38,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,082 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:52:39,083 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:39,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,201 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:52:39,202 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:39,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,279 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:52:39,280 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:39,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,357 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:52:39,358 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:39,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,534 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:52:39,535 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:39,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,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:52:39,737 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:39,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,860 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:52:39,861 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:39,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:39,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:39,971 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:52:39,971 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:40,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,184 INFO L237 Elim1Store]: Index analysis took 177 ms [2019-11-26 20:52:40,397 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:40,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:40,398 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:52:40,400 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:40,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:40,516 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:52:40,517 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:40,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:40,704 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:52:40,706 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:40,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:40,863 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-26 20:52:40,992 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:40,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:40,993 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:52:40,995 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:41,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:41,230 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:52:41,231 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:41,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:41,403 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:52:41,404 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:41,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,550 INFO L237 Elim1Store]: Index analysis took 107 ms [2019-11-26 20:52:41,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:41,661 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:52:41,662 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:41,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:41,865 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:52:41,866 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:41,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:41,945 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:41,945 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:52:41,946 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:41,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,090 INFO L237 Elim1Store]: Index analysis took 104 ms [2019-11-26 20:52:42,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:42,169 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:52:42,170 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:42,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,331 INFO L237 Elim1Store]: Index analysis took 111 ms [2019-11-26 20:52:42,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:42,446 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:52:42,448 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:42,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,614 INFO L237 Elim1Store]: Index analysis took 117 ms [2019-11-26 20:52:42,746 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:42,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:42,747 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:52:42,749 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:42,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,875 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:42,875 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:52:42,876 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:42,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:42,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:42,999 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:52:43,000 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:43,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,194 INFO L237 Elim1Store]: Index analysis took 116 ms [2019-11-26 20:52:43,314 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:43,315 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:52:43,316 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:43,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:43,492 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:52:43,493 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:43,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,634 INFO L237 Elim1Store]: Index analysis took 109 ms [2019-11-26 20:52:43,771 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:43,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:43,772 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:52:43,774 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:43,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:43,897 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:52:43,898 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:43,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:43,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:44,079 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:52:44,080 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:44,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:44,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:52:44,214 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:44,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,380 INFO L237 Elim1Store]: Index analysis took 133 ms [2019-11-26 20:52:44,512 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:44,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:44,513 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:52:44,515 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:44,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:44,631 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:52:44,632 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:44,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,783 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-11-26 20:52:44,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:44,907 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:52:44,908 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:44,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:44,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,056 INFO L237 Elim1Store]: Index analysis took 111 ms [2019-11-26 20:52:45,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:45,171 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:52:45,173 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:45,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:45,292 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:52:45,293 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:45,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:45,507 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:52:45,508 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:45,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,556 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:52:45,556 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:45,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:45,734 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:52:45,736 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:45,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:45,851 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:52:45,852 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:45,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:45,930 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:52:45,931 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:45,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:45,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:46,006 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:52:46,006 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:46,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,145 INFO L237 Elim1Store]: Index analysis took 104 ms [2019-11-26 20:52:46,283 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:46,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:46,284 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:52:46,286 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:46,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:46,504 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:52:46,505 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:46,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:46,645 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:52:46,646 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:46,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:46,739 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:52:46,739 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:46,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:46,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:46,926 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:52:46,927 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:46,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,119 INFO L237 Elim1Store]: Index analysis took 152 ms [2019-11-26 20:52:47,309 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:47,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:47,311 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:52:47,313 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:47,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:47,492 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:52:47,494 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:47,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:47,569 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:52:47,569 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:47,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:47,752 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:52:47,753 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:47,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:47,880 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:52:47,881 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:47,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:47,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:47,998 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:52:47,999 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:48,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:48,073 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:52:48,074 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:48,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,226 INFO L237 Elim1Store]: Index analysis took 112 ms [2019-11-26 20:52:48,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:48,348 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:52:48,349 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:48,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,498 INFO L237 Elim1Store]: Index analysis took 109 ms [2019-11-26 20:52:48,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:48,622 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:52:48,624 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:48,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:48,750 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:52:48,751 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:48,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:48,881 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:52:48,882 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:48,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:48,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:48,994 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:52:48,995 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:49,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:49,122 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:52:49,123 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:49,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:49,242 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:52:49,242 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:49,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,397 INFO L237 Elim1Store]: Index analysis took 115 ms [2019-11-26 20:52:49,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:49,524 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:52:49,525 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:49,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:49,604 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:52:49,604 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:49,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,765 INFO L237 Elim1Store]: Index analysis took 116 ms [2019-11-26 20:52:49,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:49,879 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:52:49,880 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:49,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:49,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,039 INFO L237 Elim1Store]: Index analysis took 115 ms [2019-11-26 20:52:50,159 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:50,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 40 treesize of output 134 [2019-11-26 20:52:50,161 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:50,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:50,293 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:52:50,294 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:50,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:50,422 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:52:50,423 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:50,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,539 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:50,539 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:52:50,540 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:50,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:50,722 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:52:50,723 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:50,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:50,872 INFO L237 Elim1Store]: Index analysis took 109 ms [2019-11-26 20:52:50,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:50,988 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:52:50,990 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:51,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:51,060 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:52:51,060 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:51,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:51,248 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:52:51,249 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:51,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:51,383 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:52:51,384 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:51,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,581 INFO L237 Elim1Store]: Index analysis took 155 ms [2019-11-26 20:52:51,784 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:51,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:51,785 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:52:51,786 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:51,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:51,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:51,971 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:52:51,972 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:52,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:52,173 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:52:52,174 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:52,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,305 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:52,306 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:52:52,307 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:52,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:52,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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:52:52,492 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:52,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:52,707 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:52:52,708 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:52,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,780 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:52,780 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:52:52,781 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:52,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:52,863 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:52:52,864 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:52,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:52,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,048 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:52:53,049 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:53,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,242 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:52:53,243 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:53,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,322 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,323 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:52:53,323 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:53,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,532 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:52:53,533 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:53,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,672 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:52:53,673 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:53,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,799 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:52:53,800 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:53,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,917 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:52:53,918 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:53,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:53,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:53,993 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:52:53,994 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:54,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:54,180 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:52:54,180 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:54,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:54,310 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:52:54,311 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:54,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:54,492 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:52:54,493 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:54,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,652 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-26 20:52:54,783 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:54,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:54,783 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:52:54,785 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:54,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:54,877 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:52:54,878 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:54,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:54,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:55,071 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:52:55,073 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:55,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:55,199 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:52:55,199 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:55,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:55,388 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:52:55,389 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:55,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:55,586 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:52:55,587 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:55,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:55,773 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:52:55,774 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:55,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:55,873 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:52:55,873 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:55,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,928 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:52:55,928 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:55,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:55,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:56,008 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:52:56,009 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:56,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,159 INFO L237 Elim1Store]: Index analysis took 110 ms [2019-11-26 20:52:56,289 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:52:56,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:56,290 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:52:56,292 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:56,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:56,420 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:52:56,421 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:56,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,611 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:56,611 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:52:56,613 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:56,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:56,744 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:52:56,745 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:56,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:56,945 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:56,945 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:52:56,946 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:57,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:57,149 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:52:57,151 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:57,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:57,281 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:52:57,282 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:57,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,473 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-11-26 20:52:57,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:57,592 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:52:57,593 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:57,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:57,711 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:52:57,712 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:57,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:57,910 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:52:57,911 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:57,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:57,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,120 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:58,121 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:52:58,122 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:58,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:58,303 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:52:58,304 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:58,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,534 INFO L237 Elim1Store]: Index analysis took 182 ms [2019-11-26 20:52:58,730 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:52:58,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:58,731 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:52:58,734 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:58,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:58,861 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:52:58,862 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:58,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:58,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,012 INFO L237 Elim1Store]: Index analysis took 108 ms [2019-11-26 20:52:59,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:59,136 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:52:59,138 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:59,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:59,262 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:52:59,263 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:59,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:59,356 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:52:59,357 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:59,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,486 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:59,486 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:52:59,487 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:59,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,652 INFO L237 Elim1Store]: Index analysis took 122 ms [2019-11-26 20:52:59,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:59,775 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:52:59,776 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:59,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:52:59,910 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:52:59,911 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-26 20:52:59,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:52:59,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,067 INFO L237 Elim1Store]: Index analysis took 114 ms [2019-11-26 20:53:00,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:00,184 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:53:00,185 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:00,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:00,304 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:53:00,305 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:00,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,478 INFO L237 Elim1Store]: Index analysis took 128 ms [2019-11-26 20:53:00,630 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:53:00,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:00,631 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:53:00,632 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:00,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:00,852 INFO L237 Elim1Store]: Index analysis took 175 ms [2019-11-26 20:53:01,040 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:53:01,041 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:01,041 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:53:01,044 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:01,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:01,239 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:53:01,240 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:01,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,294 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:53:01,295 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:01,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:01,371 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:53:01,371 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:01,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,529 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-11-26 20:53:01,676 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:53:01,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:01,677 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:53:01,679 INFO L508 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:01,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:01,754 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:53:01,755 INFO L508 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:01,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:01,949 INFO L237 Elim1Store]: Index analysis took 155 ms [2019-11-26 20:53:02,165 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 20:53:02,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:02,166 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:53:02,168 INFO L508 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:02,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,379 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:02,379 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:53:02,380 INFO L508 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:02,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,550 INFO L237 Elim1Store]: Index analysis took 125 ms [2019-11-26 20:53:02,689 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 20:53:02,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:02,690 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:53:02,692 INFO L508 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:02,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:02,858 INFO L237 Elim1Store]: Index analysis took 122 ms [2019-11-26 20:53:02,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:02,979 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:53:02,980 INFO L508 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:03,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,158 INFO L237 Elim1Store]: Index analysis took 132 ms [2019-11-26 20:53:03,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:03,286 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:53:03,288 INFO L508 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:03,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:03,410 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:53:03,411 INFO L508 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:03,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:03,533 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:53:03,534 INFO L508 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:03,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,710 INFO L237 Elim1Store]: Index analysis took 132 ms [2019-11-26 20:53:03,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:03,834 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:53:03,836 INFO L508 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:03,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:03,960 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:03,960 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:53:03,961 INFO L508 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:04,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:04,180 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:53:04,181 INFO L508 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:04,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:04,398 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:53:04,399 INFO L508 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:04,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,611 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:04,611 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:53:04,612 INFO L508 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:04,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,727 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:04,727 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:53:04,728 INFO L508 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:04,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:04,878 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:53:04,879 INFO L508 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:04,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:04,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:04,959 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:53:04,960 INFO L508 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:05,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:05,170 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:53:05,171 INFO L508 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:05,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:05,254 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:53:05,255 INFO L508 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:05,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,316 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:53:05,316 INFO L508 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:05,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:05,533 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:53:05,535 INFO L508 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:05,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:05,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:53:05,736 INFO L508 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:05,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:05,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:05,955 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:53:05,956 INFO L508 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:05,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:06,032 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:53:06,032 INFO L508 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:06,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:06,169 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:53:06,170 INFO L508 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:06,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,332 INFO L237 Elim1Store]: Index analysis took 115 ms [2019-11-26 20:53:06,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:06,453 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:53:06,455 INFO L508 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:06,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:06,655 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:53:06,656 INFO L508 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:06,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:06,793 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:53:06,793 INFO L508 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:06,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:06,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:06,978 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:53:06,979 INFO L508 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:07,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:07,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:07,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:07,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:07,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:07,119 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:53:07,120 INFO L508 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:10,434 WARN L192 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 397 DAG size of output: 34 [2019-11-26 20:53:10,435 INFO L588 ElimStorePlain]: treesize reduction 21435, result has 0.4 percent of original size [2019-11-26 20:53:10,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:10,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 13 treesize of output 9 [2019-11-26 20:53:10,442 INFO L508 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:10,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:10,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:53:10,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2019-11-26 20:53:10,469 INFO L508 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:10,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:53:10,474 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:53:10,474 INFO L508 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2019-11-26 20:53:10,503 INFO L588 ElimStorePlain]: treesize reduction 43, result has 27.1 percent of original size [2019-11-26 20:53:10,504 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:53:10,504 INFO L221 ElimStorePlain]: Needed 195 recursive calls to eliminate 8 variables, input treesize:13986, output treesize:16 [2019-11-26 20:53:10,579 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:53:10,579 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:53:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:53:11,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:53:11,563 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-26 20:53:11,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:53:11,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:53:11,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:53:11,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:53:11,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:53:11,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:53:11,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 20:53:11,582 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2019-11-26 20:53:11,594 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-26 20:53:11,604 INFO L404 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_3|], 6=[|v_old(#valid)_BEFORE_CALL_3|]} [2019-11-26 20:53:11,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 20:53:11,806 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:53:11,814 INFO L168 Benchmark]: Toolchain (without parser) took 121256.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.1 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -78.3 MB). Peak memory consumption was 333.8 MB. Max. memory is 11.5 GB. [2019-11-26 20:53:11,815 INFO L168 Benchmark]: CDTParser took 0.28 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:53:11,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-26 20:53:11,815 INFO L168 Benchmark]: Boogie Preprocessor took 93.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:53:11,815 INFO L168 Benchmark]: RCFGBuilder took 981.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2019-11-26 20:53:11,816 INFO L168 Benchmark]: TraceAbstraction took 119480.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -17.7 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. [2019-11-26 20:53:11,817 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.28 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 693.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 981.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119480.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -17.7 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...