./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5a079682 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b34e199f0da2018b0ae97fc3f9a24725315a1b16 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b34e199f0da2018b0ae97fc3f9a24725315a1b16 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:01:33,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:01:33,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:01:33,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:01:33,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:01:33,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:01:33,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:01:33,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:01:33,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:01:33,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:01:33,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:01:33,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:01:33,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:01:33,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:01:33,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:01:33,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:01:33,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:01:33,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:01:33,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:01:33,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:01:33,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:01:33,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:01:33,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:01:33,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:01:33,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:01:33,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:01:33,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:01:33,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:01:33,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:01:33,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:01:33,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:01:33,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:01:33,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:01:33,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:01:33,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:01:33,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:01:33,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:01:33,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:01:33,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:01:33,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:01:33,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:01:33,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 11:01:33,903 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:01:33,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:01:33,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:01:33,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:01:33,908 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:01:33,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:01:33,908 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:01:33,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:01:33,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:01:33,910 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:01:33,910 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:01:33,910 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:01:33,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:01:33,912 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:01:33,912 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:01:33,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:01:33,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:01:33,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:01:33,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:01:33,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:01:33,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:01:33,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:01:33,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:01:33,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:01:33,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2019-11-22 11:01:34,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:01:34,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:01:34,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:01:34,270 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:01:34,271 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:01:34,271 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 11:01:34,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42b2094e/e1b24a17218941aca9745b7b2be2715e/FLAGc8a14449c [2019-11-22 11:01:34,902 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:01:34,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 11:01:34,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42b2094e/e1b24a17218941aca9745b7b2be2715e/FLAGc8a14449c [2019-11-22 11:01:35,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42b2094e/e1b24a17218941aca9745b7b2be2715e [2019-11-22 11:01:35,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:01:35,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:01:35,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:01:35,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:01:35,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:01:35,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bddb3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35, skipping insertion in model container [2019-11-22 11:01:35,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:01:35,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:01:35,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:01:35,732 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:01:35,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:01:35,872 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:01:35,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35 WrapperNode [2019-11-22 11:01:35,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:01:35,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:01:35,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:01:35,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:01:35,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:01:35,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:01:35,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:01:35,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:01:35,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:01:36,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:01:36,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:01:36,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 11:01:36,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 11:01:36,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 11:01:36,037 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 11:01:36,037 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 11:01:36,037 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 11:01:36,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:01:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 11:01:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 11:01:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 11:01:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 11:01:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 11:01:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 11:01:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 11:01:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 11:01:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 11:01:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 11:01:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 11:01:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 11:01:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 11:01:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 11:01:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 11:01:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 11:01:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 11:01:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 11:01:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 11:01:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 11:01:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 11:01:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 11:01:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 11:01:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 11:01:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 11:01:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 11:01:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 11:01:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 11:01:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 11:01:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 11:01:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 11:01:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 11:01:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 11:01:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 11:01:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 11:01:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 11:01:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 11:01:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 11:01:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 11:01:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 11:01:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 11:01:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 11:01:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 11:01:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 11:01:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 11:01:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 11:01:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:01:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 11:01:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:01:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 11:01:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 11:01:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 11:01:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 11:01:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 11:01:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 11:01:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 11:01:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 11:01:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 11:01:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 11:01:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 11:01:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 11:01:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 11:01:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 11:01:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 11:01:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 11:01:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 11:01:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 11:01:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 11:01:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 11:01:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 11:01:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 11:01:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 11:01:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 11:01:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 11:01:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 11:01:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 11:01:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 11:01:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 11:01:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 11:01:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 11:01:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 11:01:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 11:01:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 11:01:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 11:01:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 11:01:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 11:01:36,062 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 11:01:36,062 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 11:01:36,062 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 11:01:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 11:01:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 11:01:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 11:01:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 11:01:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 11:01:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 11:01:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 11:01:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 11:01:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 11:01:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 11:01:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 11:01:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 11:01:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 11:01:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 11:01:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 11:01:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 11:01:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 11:01:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 11:01:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 11:01:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 11:01:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 11:01:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 11:01:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 11:01:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 11:01:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 11:01:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 11:01:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 11:01:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 11:01:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 11:01:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 11:01:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 11:01:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 11:01:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 11:01:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 11:01:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 11:01:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 11:01:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 11:01:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 11:01:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 11:01:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 11:01:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 11:01:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 11:01:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 11:01:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 11:01:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 11:01:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 11:01:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 11:01:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 11:01:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 11:01:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 11:01:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 11:01:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:01:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 11:01:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 11:01:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 11:01:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:01:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:01:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:01:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:01:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:01:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-22 11:01:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 11:01:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:01:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 11:01:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:01:36,728 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:01:36,729 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 11:01:36,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:36 BoogieIcfgContainer [2019-11-22 11:01:36,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:01:36,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:01:36,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:01:36,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:01:36,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:01:35" (1/3) ... [2019-11-22 11:01:36,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3575d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:01:36, skipping insertion in model container [2019-11-22 11:01:36,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (2/3) ... [2019-11-22 11:01:36,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3575d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:01:36, skipping insertion in model container [2019-11-22 11:01:36,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:36" (3/3) ... [2019-11-22 11:01:36,744 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-22 11:01:36,755 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:01:36,764 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 11:01:36,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 11:01:36,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:01:36,791 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:01:36,791 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:01:36,791 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:01:36,792 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:01:36,792 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:01:36,792 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:01:36,792 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:01:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 11:01:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:01:36,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:36,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:36,826 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989328, now seen corresponding path program 1 times [2019-11-22 11:01:36,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:36,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741855595] [2019-11-22 11:01:36,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:37,309 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-22 11:01:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:37,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741855595] [2019-11-22 11:01:37,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:37,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 11:01:37,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657661070] [2019-11-22 11:01:37,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:01:37,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:01:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:01:37,438 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-22 11:01:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:37,990 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2019-11-22 11:01:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:01:37,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-22 11:01:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:38,005 INFO L225 Difference]: With dead ends: 97 [2019-11-22 11:01:38,005 INFO L226 Difference]: Without dead ends: 88 [2019-11-22 11:01:38,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:01:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-22 11:01:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-11-22 11:01:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-22 11:01:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2019-11-22 11:01:38,068 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 9 [2019-11-22 11:01:38,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:38,069 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2019-11-22 11:01:38,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:01:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2019-11-22 11:01:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:01:38,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:38,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:38,072 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989329, now seen corresponding path program 1 times [2019-11-22 11:01:38,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:38,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068508398] [2019-11-22 11:01:38,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:38,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068508398] [2019-11-22 11:01:38,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:38,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:01:38,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743745185] [2019-11-22 11:01:38,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:01:38,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:38,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:01:38,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:01:38,311 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand 6 states. [2019-11-22 11:01:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:39,142 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2019-11-22 11:01:39,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:01:39,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 11:01:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:39,149 INFO L225 Difference]: With dead ends: 165 [2019-11-22 11:01:39,149 INFO L226 Difference]: Without dead ends: 165 [2019-11-22 11:01:39,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:01:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-22 11:01:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2019-11-22 11:01:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-22 11:01:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 192 transitions. [2019-11-22 11:01:39,173 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 192 transitions. Word has length 9 [2019-11-22 11:01:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:39,174 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 192 transitions. [2019-11-22 11:01:39,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:01:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2019-11-22 11:01:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:01:39,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:39,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:39,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1859028932, now seen corresponding path program 1 times [2019-11-22 11:01:39,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:39,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479964920] [2019-11-22 11:01:39,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:39,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479964920] [2019-11-22 11:01:39,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:39,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:01:39,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805085512] [2019-11-22 11:01:39,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:01:39,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:39,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:01:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:01:39,593 INFO L87 Difference]: Start difference. First operand 134 states and 192 transitions. Second operand 6 states. [2019-11-22 11:01:39,842 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-22 11:01:39,984 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-22 11:01:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:40,769 INFO L93 Difference]: Finished difference Result 246 states and 348 transitions. [2019-11-22 11:01:40,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:01:40,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 11:01:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:40,775 INFO L225 Difference]: With dead ends: 246 [2019-11-22 11:01:40,775 INFO L226 Difference]: Without dead ends: 246 [2019-11-22 11:01:40,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:01:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-22 11:01:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 192. [2019-11-22 11:01:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 11:01:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 283 transitions. [2019-11-22 11:01:40,803 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 283 transitions. Word has length 10 [2019-11-22 11:01:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:40,803 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 283 transitions. [2019-11-22 11:01:40,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:01:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 283 transitions. [2019-11-22 11:01:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 11:01:40,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:40,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:40,805 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1795322128, now seen corresponding path program 1 times [2019-11-22 11:01:40,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:40,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963741162] [2019-11-22 11:01:40,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:41,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963741162] [2019-11-22 11:01:41,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:41,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:01:41,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153307054] [2019-11-22 11:01:41,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:01:41,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:01:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:01:41,256 INFO L87 Difference]: Start difference. First operand 192 states and 283 transitions. Second operand 6 states. [2019-11-22 11:01:41,548 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-22 11:01:41,703 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-11-22 11:01:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:42,432 INFO L93 Difference]: Finished difference Result 226 states and 305 transitions. [2019-11-22 11:01:42,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:01:42,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-22 11:01:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:42,435 INFO L225 Difference]: With dead ends: 226 [2019-11-22 11:01:42,435 INFO L226 Difference]: Without dead ends: 226 [2019-11-22 11:01:42,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-22 11:01:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-11-22 11:01:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 11:01:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2019-11-22 11:01:42,459 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 11 [2019-11-22 11:01:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:42,461 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2019-11-22 11:01:42,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:01:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2019-11-22 11:01:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 11:01:42,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:42,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:42,463 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash -179588794, now seen corresponding path program 1 times [2019-11-22 11:01:42,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:42,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118224326] [2019-11-22 11:01:42,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:42,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118224326] [2019-11-22 11:01:42,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:42,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:01:42,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265429414] [2019-11-22 11:01:42,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:01:42,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:42,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:01:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:01:42,645 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand 7 states. [2019-11-22 11:01:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:43,598 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2019-11-22 11:01:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:01:43,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-22 11:01:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:43,601 INFO L225 Difference]: With dead ends: 271 [2019-11-22 11:01:43,601 INFO L226 Difference]: Without dead ends: 271 [2019-11-22 11:01:43,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:01:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-22 11:01:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 223. [2019-11-22 11:01:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 11:01:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 325 transitions. [2019-11-22 11:01:43,618 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 325 transitions. Word has length 12 [2019-11-22 11:01:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:43,619 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 325 transitions. [2019-11-22 11:01:43,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:01:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 325 transitions. [2019-11-22 11:01:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 11:01:43,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:43,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:43,621 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1272285230, now seen corresponding path program 1 times [2019-11-22 11:01:43,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:43,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198817148] [2019-11-22 11:01:43,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:43,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198817148] [2019-11-22 11:01:43,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:43,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:01:43,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989964371] [2019-11-22 11:01:43,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:01:43,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:43,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:01:43,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:01:43,848 INFO L87 Difference]: Start difference. First operand 223 states and 325 transitions. Second operand 7 states. [2019-11-22 11:01:44,106 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-22 11:01:44,296 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-22 11:01:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:44,839 INFO L93 Difference]: Finished difference Result 255 states and 337 transitions. [2019-11-22 11:01:44,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:01:44,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-22 11:01:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:44,843 INFO L225 Difference]: With dead ends: 255 [2019-11-22 11:01:44,844 INFO L226 Difference]: Without dead ends: 255 [2019-11-22 11:01:44,844 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-22 11:01:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-22 11:01:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2019-11-22 11:01:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 11:01:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 323 transitions. [2019-11-22 11:01:44,864 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 323 transitions. Word has length 13 [2019-11-22 11:01:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:44,864 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 323 transitions. [2019-11-22 11:01:44,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:01:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 323 transitions. [2019-11-22 11:01:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 11:01:44,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:44,866 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:44,867 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash 668439832, now seen corresponding path program 1 times [2019-11-22 11:01:44,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:44,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289357459] [2019-11-22 11:01:44,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:45,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289357459] [2019-11-22 11:01:45,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286391394] [2019-11-22 11:01:45,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:45,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:01:45,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:45,475 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:01:45,479 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:01:45,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 11:01:45,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:45,557 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 11:01:45,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:01:45,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 11:01:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:45,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:45,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-11-22 11:01:45,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905548008] [2019-11-22 11:01:45,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:01:45,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:45,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:01:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:45,631 INFO L87 Difference]: Start difference. First operand 223 states and 323 transitions. Second operand 10 states. [2019-11-22 11:01:46,091 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-22 11:01:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:46,544 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2019-11-22 11:01:46,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:01:46,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 11:01:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:46,548 INFO L225 Difference]: With dead ends: 257 [2019-11-22 11:01:46,548 INFO L226 Difference]: Without dead ends: 257 [2019-11-22 11:01:46,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:01:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-22 11:01:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 227. [2019-11-22 11:01:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-22 11:01:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2019-11-22 11:01:46,572 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 17 [2019-11-22 11:01:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:46,572 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2019-11-22 11:01:46,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:01:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2019-11-22 11:01:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 11:01:46,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:46,576 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:46,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:46,777 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:01:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash -753201699, now seen corresponding path program 1 times [2019-11-22 11:01:46,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:46,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427068641] [2019-11-22 11:01:46,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:47,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427068641] [2019-11-22 11:01:47,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617840150] [2019-11-22 11:01:47,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:47,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-22 11:01:47,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:47,722 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-22 11:01:47,723 INFO L343 Elim1Store]: treesize reduction 487, result has 22.1 percent of original size [2019-11-22 11:01:47,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 324 treesize of output 420 [2019-11-22 11:01:47,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:48,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:48,585 WARN L192 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 61 [2019-11-22 11:01:48,586 INFO L567 ElimStorePlain]: treesize reduction 12278, result has 1.1 percent of original size [2019-11-22 11:01:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:01:48,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:120, output treesize:134 [2019-11-22 11:01:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:49,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:49,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:49,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:51,909 WARN L192 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-22 11:01:52,834 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-22 11:01:52,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:01:52,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2019-11-22 11:01:52,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:53,013 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 11:01:53,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:53,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 77 [2019-11-22 11:01:53,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:53,143 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 11:01:53,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:53,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2019-11-22 11:01:53,156 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:53,297 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-22 11:01:53,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:53,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 3 xjuncts. [2019-11-22 11:01:53,300 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:307, output treesize:222 [2019-11-22 11:01:55,829 WARN L192 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-22 11:01:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:01:55,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:55,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2019-11-22 11:01:55,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698394786] [2019-11-22 11:01:55,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-22 11:01:55,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:55,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-22 11:01:55,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-22 11:01:55,848 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand 15 states. [2019-11-22 11:01:56,187 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-22 11:01:56,794 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 178 [2019-11-22 11:01:57,075 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-22 11:01:59,056 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 229 DAG size of output: 178 [2019-11-22 11:01:59,471 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-22 11:02:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:00,919 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2019-11-22 11:02:00,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 11:02:00,920 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-22 11:02:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:00,922 INFO L225 Difference]: With dead ends: 278 [2019-11-22 11:02:00,922 INFO L226 Difference]: Without dead ends: 278 [2019-11-22 11:02:00,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-22 11:02:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-22 11:02:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 233. [2019-11-22 11:02:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-22 11:02:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 326 transitions. [2019-11-22 11:02:00,934 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 326 transitions. Word has length 18 [2019-11-22 11:02:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:00,935 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 326 transitions. [2019-11-22 11:02:00,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-22 11:02:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 326 transitions. [2019-11-22 11:02:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 11:02:00,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:00,936 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:01,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:01,140 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1874416105, now seen corresponding path program 1 times [2019-11-22 11:02:01,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:01,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955457752] [2019-11-22 11:02:01,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:01,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955457752] [2019-11-22 11:02:01,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486186750] [2019-11-22 11:02:01,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:01,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:02:01,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:02:01,686 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 23=[|v_#valid_49|]} [2019-11-22 11:02:01,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,745 INFO L343 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2019-11-22 11:02:01,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2019-11-22 11:02:01,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:01,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:01,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:01,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:01,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 223 [2019-11-22 11:02:01,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:01,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:02,118 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-22 11:02:02,119 INFO L567 ElimStorePlain]: treesize reduction 1486, result has 6.2 percent of original size [2019-11-22 11:02:02,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:02:02,120 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:135, output treesize:99 [2019-11-22 11:02:02,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2019-11-22 11:02:02,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:02,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:02,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 11:02:02,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:02,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:02,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:02:02,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:66 [2019-11-22 11:02:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:02,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:02:02,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-11-22 11:02:02,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929432699] [2019-11-22 11:02:02,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 11:02:02,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 11:02:02,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:02:02,466 INFO L87 Difference]: Start difference. First operand 233 states and 326 transitions. Second operand 14 states. [2019-11-22 11:02:02,801 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-11-22 11:02:03,027 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 11:02:03,313 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-22 11:02:03,860 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-11-22 11:02:04,263 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-22 11:02:04,797 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-22 11:02:05,266 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-22 11:02:05,628 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-11-22 11:02:05,991 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-11-22 11:02:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:06,717 INFO L93 Difference]: Finished difference Result 266 states and 355 transitions. [2019-11-22 11:02:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 11:02:06,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-22 11:02:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:06,720 INFO L225 Difference]: With dead ends: 266 [2019-11-22 11:02:06,720 INFO L226 Difference]: Without dead ends: 266 [2019-11-22 11:02:06,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-11-22 11:02:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-22 11:02:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2019-11-22 11:02:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-22 11:02:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 323 transitions. [2019-11-22 11:02:06,731 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 323 transitions. Word has length 19 [2019-11-22 11:02:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:06,731 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 323 transitions. [2019-11-22 11:02:06,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 11:02:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 323 transitions. [2019-11-22 11:02:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:02:06,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:06,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:06,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:06,936 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash 550415913, now seen corresponding path program 1 times [2019-11-22 11:02:06,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:06,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574635235] [2019-11-22 11:02:06,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:07,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574635235] [2019-11-22 11:02:07,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:07,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 11:02:07,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469454426] [2019-11-22 11:02:07,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:07,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:07,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:07,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:07,028 INFO L87 Difference]: Start difference. First operand 233 states and 323 transitions. Second operand 4 states. [2019-11-22 11:02:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:07,367 INFO L93 Difference]: Finished difference Result 331 states and 471 transitions. [2019-11-22 11:02:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:02:07,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-22 11:02:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:07,370 INFO L225 Difference]: With dead ends: 331 [2019-11-22 11:02:07,370 INFO L226 Difference]: Without dead ends: 331 [2019-11-22 11:02:07,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:02:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-22 11:02:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 312. [2019-11-22 11:02:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-22 11:02:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 461 transitions. [2019-11-22 11:02:07,384 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 461 transitions. Word has length 23 [2019-11-22 11:02:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:07,384 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 461 transitions. [2019-11-22 11:02:07,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 461 transitions. [2019-11-22 11:02:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:02:07,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:07,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:07,386 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash 550416137, now seen corresponding path program 1 times [2019-11-22 11:02:07,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:07,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927803198] [2019-11-22 11:02:07,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:07,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927803198] [2019-11-22 11:02:07,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:07,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:02:07,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243218627] [2019-11-22 11:02:07,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:07,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:07,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:07,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:07,479 INFO L87 Difference]: Start difference. First operand 312 states and 461 transitions. Second operand 4 states. [2019-11-22 11:02:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:07,743 INFO L93 Difference]: Finished difference Result 311 states and 458 transitions. [2019-11-22 11:02:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:02:07,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-22 11:02:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:07,746 INFO L225 Difference]: With dead ends: 311 [2019-11-22 11:02:07,746 INFO L226 Difference]: Without dead ends: 311 [2019-11-22 11:02:07,747 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-22 11:02:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-22 11:02:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-11-22 11:02:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-22 11:02:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 458 transitions. [2019-11-22 11:02:07,759 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 458 transitions. Word has length 23 [2019-11-22 11:02:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:07,759 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 458 transitions. [2019-11-22 11:02:07,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 458 transitions. [2019-11-22 11:02:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 11:02:07,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:07,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:07,760 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash -116975829, now seen corresponding path program 1 times [2019-11-22 11:02:07,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:07,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495561433] [2019-11-22 11:02:07,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:07,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495561433] [2019-11-22 11:02:07,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:07,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 11:02:07,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093788060] [2019-11-22 11:02:07,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:07,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:07,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:07,858 INFO L87 Difference]: Start difference. First operand 311 states and 458 transitions. Second operand 4 states. [2019-11-22 11:02:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:08,252 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2019-11-22 11:02:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:02:08,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 11:02:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:08,257 INFO L225 Difference]: With dead ends: 381 [2019-11-22 11:02:08,257 INFO L226 Difference]: Without dead ends: 381 [2019-11-22 11:02:08,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:02:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-22 11:02:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 360. [2019-11-22 11:02:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-22 11:02:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 526 transitions. [2019-11-22 11:02:08,275 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 526 transitions. Word has length 24 [2019-11-22 11:02:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:08,277 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 526 transitions. [2019-11-22 11:02:08,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 526 transitions. [2019-11-22 11:02:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 11:02:08,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:08,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:08,283 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash -116968878, now seen corresponding path program 1 times [2019-11-22 11:02:08,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:08,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094705467] [2019-11-22 11:02:08,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:08,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094705467] [2019-11-22 11:02:08,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:08,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:02:08,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010479375] [2019-11-22 11:02:08,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:08,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:08,388 INFO L87 Difference]: Start difference. First operand 360 states and 526 transitions. Second operand 4 states. [2019-11-22 11:02:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:08,683 INFO L93 Difference]: Finished difference Result 335 states and 491 transitions. [2019-11-22 11:02:08,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:02:08,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 11:02:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:08,688 INFO L225 Difference]: With dead ends: 335 [2019-11-22 11:02:08,688 INFO L226 Difference]: Without dead ends: 335 [2019-11-22 11:02:08,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:02:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-22 11:02:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2019-11-22 11:02:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-22 11:02:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 489 transitions. [2019-11-22 11:02:08,708 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 489 transitions. Word has length 24 [2019-11-22 11:02:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:08,709 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 489 transitions. [2019-11-22 11:02:08,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 489 transitions. [2019-11-22 11:02:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:02:08,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:08,716 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:08,716 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 35178027, now seen corresponding path program 1 times [2019-11-22 11:02:08,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:08,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411287761] [2019-11-22 11:02:08,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:08,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411287761] [2019-11-22 11:02:08,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:08,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:02:08,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910216698] [2019-11-22 11:02:08,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:02:08,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:02:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:02:08,845 INFO L87 Difference]: Start difference. First operand 333 states and 489 transitions. Second operand 5 states. [2019-11-22 11:02:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:09,070 INFO L93 Difference]: Finished difference Result 242 states and 337 transitions. [2019-11-22 11:02:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:02:09,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-22 11:02:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:09,074 INFO L225 Difference]: With dead ends: 242 [2019-11-22 11:02:09,074 INFO L226 Difference]: Without dead ends: 242 [2019-11-22 11:02:09,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:02:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-22 11:02:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 233. [2019-11-22 11:02:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-22 11:02:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2019-11-22 11:02:09,089 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 33 [2019-11-22 11:02:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:09,089 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2019-11-22 11:02:09,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:02:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2019-11-22 11:02:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:02:09,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:09,095 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:09,095 INFO L410 AbstractCegarLoop]: === Iteration 15 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash -138461554, now seen corresponding path program 1 times [2019-11-22 11:02:09,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:09,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653934026] [2019-11-22 11:02:09,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 11:02:09,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653934026] [2019-11-22 11:02:09,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974110071] [2019-11-22 11:02:09,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:09,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-22 11:02:09,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:02:09,802 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2019-11-22 11:02:09,803 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 11:02:09,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 202 treesize of output 258 [2019-11-22 11:02:09,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:09,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:10,064 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-11-22 11:02:10,065 INFO L567 ElimStorePlain]: treesize reduction 1301, result has 6.8 percent of original size [2019-11-22 11:02:10,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:10,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:02:10,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:95 [2019-11-22 11:02:10,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:10,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:11,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:11,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:12,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:12,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:12,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 11:02:12,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:12,445 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:12,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:12,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:12,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 11:02:12,501 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:12,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:12,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 11:02:12,559 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:12,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:12,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:12,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:12,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:12,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:12,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 121 [2019-11-22 11:02:12,635 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:12,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:12,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 11:02:12,686 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:12,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:12,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 11:02:12,723 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:12,992 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-22 11:02:12,993 INFO L567 ElimStorePlain]: treesize reduction 52, result has 81.0 percent of original size [2019-11-22 11:02:12,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:02:12,995 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:527, output treesize:12 [2019-11-22 11:02:13,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:13,695 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 11:02:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 11:02:13,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:02:13,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 11:02:13,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618740192] [2019-11-22 11:02:13,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:02:13,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:13,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:02:13,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:02:13,832 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand 12 states. [2019-11-22 11:02:15,980 WARN L192 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-11-22 11:02:16,779 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 11:02:32,766 WARN L192 SmtUtils]: Spent 15.89 s on a formula simplification. DAG size of input: 167 DAG size of output: 109 [2019-11-22 11:02:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:39,505 INFO L93 Difference]: Finished difference Result 323 states and 423 transitions. [2019-11-22 11:02:39,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:02:39,505 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-22 11:02:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:39,509 INFO L225 Difference]: With dead ends: 323 [2019-11-22 11:02:39,509 INFO L226 Difference]: Without dead ends: 321 [2019-11-22 11:02:39,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:02:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-22 11:02:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2019-11-22 11:02:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-22 11:02:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 380 transitions. [2019-11-22 11:02:39,518 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 380 transitions. Word has length 33 [2019-11-22 11:02:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:39,519 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 380 transitions. [2019-11-22 11:02:39,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:02:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 380 transitions. [2019-11-22 11:02:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 11:02:39,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:39,520 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:39,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:39,721 INFO L410 AbstractCegarLoop]: === Iteration 16 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:39,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1145602458, now seen corresponding path program 1 times [2019-11-22 11:02:39,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:39,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983634436] [2019-11-22 11:02:39,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:39,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983634436] [2019-11-22 11:02:39,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:39,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:02:39,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975352356] [2019-11-22 11:02:39,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:02:39,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:39,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:02:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:02:39,937 INFO L87 Difference]: Start difference. First operand 273 states and 380 transitions. Second operand 7 states. [2019-11-22 11:02:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:40,557 INFO L93 Difference]: Finished difference Result 304 states and 411 transitions. [2019-11-22 11:02:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:02:40,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-22 11:02:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:40,560 INFO L225 Difference]: With dead ends: 304 [2019-11-22 11:02:40,560 INFO L226 Difference]: Without dead ends: 304 [2019-11-22 11:02:40,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:02:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-22 11:02:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-11-22 11:02:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-22 11:02:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 409 transitions. [2019-11-22 11:02:40,570 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 409 transitions. Word has length 35 [2019-11-22 11:02:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:40,570 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 409 transitions. [2019-11-22 11:02:40,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:02:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 409 transitions. [2019-11-22 11:02:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 11:02:40,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:40,571 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:40,572 INFO L410 AbstractCegarLoop]: === Iteration 17 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:02:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1732408472, now seen corresponding path program 1 times [2019-11-22 11:02:40,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:40,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151598851] [2019-11-22 11:02:40,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:40,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151598851] [2019-11-22 11:02:40,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077198864] [2019-11-22 11:02:40,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:41,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-22 11:02:41,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:02:41,297 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:02:41,298 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:02:41,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 11:02:41,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:41,402 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-22 11:02:41,403 INFO L567 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-22 11:02:41,613 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:02:41,614 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:02:41,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 11:02:41,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:41,735 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-22 11:02:41,736 INFO L567 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-22 11:02:41,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:41,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:41,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:02:41,769 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-22 11:02:41,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:41,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:41,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:41,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:41,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:41,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:41,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:41,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:41,872 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:42,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:42,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:42,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,266 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:42,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:42,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:42,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:42,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:42,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:42,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:42,889 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:43,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:43,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:43,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:43,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:43,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:43,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:43,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:43,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:43,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:43,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 40 treesize of output 58 [2019-11-22 11:02:43,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:43,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 130 [2019-11-22 11:02:43,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:43,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2019-11-22 11:02:43,692 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:43,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 98 [2019-11-22 11:02:43,760 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:43,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 135 [2019-11-22 11:02:43,855 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-11-22 11:02:43,878 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:43,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:43,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 11:02:43,920 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,945 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:43,946 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:43,966 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:43,967 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,030 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,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, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 95 [2019-11-22 11:02:44,031 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,052 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,052 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,073 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,074 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,090 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,090 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,109 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:44,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 11:02:44,143 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:44,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-11-22 11:02:44,167 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,191 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,191 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,207 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:44,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 11:02:44,214 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:44,275 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 11:02:44,276 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 11:02:44,318 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,336 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,336 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,355 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,355 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,376 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,376 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,396 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,397 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,414 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,415 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:44,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 11:02:44,483 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,517 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,518 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,540 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,541 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 95 [2019-11-22 11:02:44,633 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,649 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,649 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 11:02:44,689 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,706 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,706 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:44,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 95 [2019-11-22 11:02:44,780 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 11:02:44,812 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 11:02:44,857 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,875 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,875 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,894 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,908 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,908 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,954 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:44,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:44,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:44,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 11:02:44,971 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:44,995 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:44,995 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,023 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,024 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 65 treesize of output 103 [2019-11-22 11:02:45,117 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,138 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,138 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,159 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,160 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:45,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 11:02:45,166 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:45,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 130 [2019-11-22 11:02:45,265 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,283 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,283 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 11:02:45,332 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 71 [2019-11-22 11:02:45,375 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,396 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:45,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 11:02:45,418 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,435 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,436 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,458 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,458 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,476 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,476 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:45,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 11:02:45,555 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 11:02:45,583 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,611 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,612 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,630 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,630 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2019-11-22 11:02:45,656 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,674 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,674 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,703 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,704 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:45,766 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,818 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 130 [2019-11-22 11:02:45,819 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,838 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,838 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 11:02:45,863 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 71 [2019-11-22 11:02:45,915 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:45,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:45,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:45,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 11:02:45,954 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,970 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,970 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:45,986 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:45,987 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:46,021 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 11:02:46,022 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 11:02:46,057 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,071 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,072 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,089 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,089 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,105 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,105 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:46,130 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 11:02:46,143 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,159 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,159 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 76 [2019-11-22 11:02:46,206 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,224 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,224 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,240 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,240 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,256 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,256 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,271 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,271 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:46,319 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 11:02:46,320 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:46,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 11:02:46,361 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,378 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,379 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 11:02:46,387 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:46,406 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,406 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 11:02:46,408 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,423 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,423 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,451 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,452 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:46,459 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,460 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 11:02:46,472 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 11:02:46,499 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:46,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-11-22 11:02:46,522 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,540 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,541 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,561 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,562 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 11:02:46,563 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,579 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,579 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,596 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,598 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,599 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 57 [2019-11-22 11:02:46,607 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,623 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,623 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 11:02:46,655 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,678 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,678 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,696 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,696 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,713 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,713 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,731 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,731 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,753 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,753 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,776 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,776 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,798 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,799 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,820 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,820 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,844 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2019-11-22 11:02:46,849 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,870 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,870 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,892 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,893 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,914 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,914 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,936 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:46,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:46,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 11:02:46,944 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,962 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,980 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,980 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:46,998 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:46,998 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,015 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,015 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,031 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,032 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,062 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:47,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 62 [2019-11-22 11:02:47,063 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,080 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,080 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,097 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,097 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,113 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,114 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,133 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 11:02:47,134 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,151 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,166 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,166 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,178 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,179 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,193 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,194 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,206 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,207 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,219 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,219 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,233 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,233 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,252 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 11:02:47,253 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,269 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,269 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-11-22 11:02:47,284 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,297 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,298 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,311 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,311 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,324 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,324 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,342 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,342 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,355 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,355 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,368 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,368 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,380 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,380 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,393 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,393 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,405 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,406 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,418 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,418 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,429 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,429 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,442 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,442 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,456 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,456 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,469 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,469 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,481 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,481 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,494 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,494 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,506 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,506 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,516 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,517 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,527 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,527 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,546 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,546 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,559 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,559 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,572 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,572 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,585 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,585 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,597 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,597 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,609 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,609 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,618 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:47,618 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,758 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-11-22 11:02:47,758 INFO L567 ElimStorePlain]: treesize reduction 812, result has 4.8 percent of original size [2019-11-22 11:02:47,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:47,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 20 treesize of output 24 [2019-11-22 11:02:47,770 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:47,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2019-11-22 11:02:47,775 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,791 INFO L567 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-22 11:02:47,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:02:47,792 INFO L221 ElimStorePlain]: Needed 153 recursive calls to eliminate 7 variables, input treesize:7491, output treesize:10 [2019-11-22 11:02:47,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:47,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:47,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:47,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:47,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:47,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:47,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:47,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:47,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:47,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:47,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:47,864 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:47,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:47,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:47,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:02:48,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:48,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:48,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:48,232 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 11:02:48,397 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 11:02:48,434 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:48,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:48,527 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:48,569 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 11:02:48,570 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:48,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:48,634 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:48,697 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:48,698 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 11:02:48,745 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:02:48,904 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:48,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:48,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 11:02:48,944 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:48,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:48,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,025 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:49,027 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:49,146 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 11:02:49,203 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:49,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:49,296 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,350 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:49,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:49,389 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 11:02:49,445 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:49,568 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 11:02:49,660 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:49,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 11:02:49,783 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,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 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:02:49,864 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:49,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:49,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:49,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:49,996 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,120 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 144 [2019-11-22 11:02:50,121 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 11:02:50,178 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 11:02:50,349 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,396 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:50,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:50,415 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:50,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:50,504 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:50,624 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:02:50,706 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 11:02:50,762 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:50,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:50,843 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:50,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:50,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 11:02:51,008 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:02:51,089 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,145 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 11:02:51,146 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:02:51,228 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,297 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:51,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 11:02:51,353 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 11:02:51,393 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 11:02:51,431 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:51,519 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:02:51,648 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2019-11-22 11:02:51,686 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:51,780 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:51,781 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:51,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:02:51,905 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:51,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:51,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:52,021 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 11:02:52,185 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,240 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 11:02:52,242 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 11:02:52,299 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,422 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:02:52,424 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 11:02:52,512 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:02:52,636 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:52,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:52,724 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:52,807 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:52,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 11:02:52,852 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:52,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:52,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:52,940 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:52,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:52,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:02:53,025 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:53,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:53,094 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:53,174 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:02:53,258 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 144 [2019-11-22 11:02:53,378 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:53,464 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 11:02:53,553 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,673 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:53,675 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:53,801 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:53,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:02:53,936 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:53,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:53,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,145 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 11:02:54,145 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 11:02:54,147 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,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 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 11:02:54,200 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,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 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:54,279 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:54,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:54,335 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 11:02:54,388 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,452 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:54,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:54,485 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 11:02:54,538 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:54,655 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,689 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:54,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:54,710 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 11:02:54,888 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:54,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, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:54,971 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:54,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,031 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:55,084 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 11:02:55,086 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:55,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 11:02:55,129 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:55,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 11:02:55,166 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,201 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:55,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:55,222 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:55,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,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, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:02:55,302 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02: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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 11:02:55,355 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 11:02:55,523 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:55,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:55,584 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:02:55,702 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:55,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 11:02:55,742 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 11:02:55,827 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 11:02:55,913 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 11:02:56,000 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:02:56,059 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:02:56,137 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,159 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,164 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 33 treesize of output 32 [2019-11-22 11:02:56,165 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,200 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 11:02:56,206 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-22 11:02:56,230 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:02:56,309 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 72 [2019-11-22 11:02:56,369 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 11:02:56,447 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2019-11-22 11:02:56,488 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 11:02:56,574 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,616 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 11:02:56,653 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,675 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,681 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 11:02:56,689 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,718 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,730 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 11:02:56,731 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,770 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,786 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 11:02:56,788 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 11:02:56,826 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:02:56,883 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,902 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,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, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 11:02:56,904 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,924 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,929 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 11:02:56,939 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,968 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 11:02:56,975 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,009 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 144 [2019-11-22 11:02:57,096 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 11:02:57,184 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:02:57,240 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 80 treesize of output 192 [2019-11-22 11:02:57,409 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 11:02:57,464 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 11:02:57,547 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,587 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 11:02:57,609 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 11:02:57,669 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,698 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 11:02:57,706 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,776 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 141 [2019-11-22 11:02:57,846 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:02:57,905 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 11:02:57,969 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,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, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-11-22 11:02:57,989 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,031 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 11:02:58,051 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 11:02:58,094 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-22 11:02:58,113 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 11:02:58,149 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 11:02:58,176 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,200 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:02:58,229 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 11:02:58,312 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 11:02:58,349 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 11:02:58,401 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,426 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:02:58,457 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 11:02:58,516 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,551 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 144 [2019-11-22 11:02:58,641 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 11:02:58,696 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,724 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,730 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 11:02:58,731 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,761 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,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 40 treesize of output 48 [2019-11-22 11:02:58,773 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,793 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 11:02:58,796 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 11:02:58,829 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 11:02:58,910 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 11:02:58,946 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,976 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 11:02:59,028 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,092 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 144 [2019-11-22 11:02:59,178 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,203 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 104 [2019-11-22 11:02:59,261 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,274 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 11:02:59,296 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2019-11-22 11:02:59,329 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:02:59,379 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,406 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 11:02:59,461 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,508 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 11:02:59,538 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 11:02:59,571 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,591 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 11:02:59,642 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 11:02:59,718 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:02:59,751 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,161 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 16 [2019-11-22 11:03:00,162 INFO L567 ElimStorePlain]: treesize reduction 3780, result has 0.5 percent of original size [2019-11-22 11:03:00,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-22 11:03:00,166 INFO L496 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,178 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-22 11:03:00,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:00,178 INFO L221 ElimStorePlain]: Needed 154 recursive calls to eliminate 8 variables, input treesize:8439, output treesize:14 [2019-11-22 11:03:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:00,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:00,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2019-11-22 11:03:00,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899127350] [2019-11-22 11:03:00,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 11:03:00,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 11:03:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-22 11:03:00,256 INFO L87 Difference]: Start difference. First operand 297 states and 409 transitions. Second operand 19 states. [2019-11-22 11:03:00,858 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-22 11:03:11,110 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-22 11:03:11,883 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-22 11:03:13,501 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-22 11:03:13,719 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-11-22 11:03:13,857 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-11-22 11:03:23,218 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-22 11:03:23,825 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-22 11:03:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:35,899 INFO L93 Difference]: Finished difference Result 531 states and 667 transitions. [2019-11-22 11:03:35,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-22 11:03:35,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-22 11:03:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:35,904 INFO L225 Difference]: With dead ends: 531 [2019-11-22 11:03:35,904 INFO L226 Difference]: Without dead ends: 531 [2019-11-22 11:03:35,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=681, Invalid=1971, Unknown=0, NotChecked=0, Total=2652 [2019-11-22 11:03:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-22 11:03:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 448. [2019-11-22 11:03:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-22 11:03:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 599 transitions. [2019-11-22 11:03:35,921 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 599 transitions. Word has length 35 [2019-11-22 11:03:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:35,921 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 599 transitions. [2019-11-22 11:03:35,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 11:03:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 599 transitions. [2019-11-22 11:03:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 11:03:35,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:35,923 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:36,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:36,127 INFO L410 AbstractCegarLoop]: === Iteration 18 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:03:36,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:36,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2659210, now seen corresponding path program 1 times [2019-11-22 11:03:36,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:36,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936062362] [2019-11-22 11:03:36,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 11:03:36,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936062362] [2019-11-22 11:03:36,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775147945] [2019-11-22 11:03:36,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:36,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 11:03:36,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:36,529 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 5=[|v_#valid_53|]} [2019-11-22 11:03:36,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:36,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:36,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:36,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:36,691 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-22 11:03:36,692 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-22 11:03:36,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 11:03:36,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:36,777 INFO L567 ElimStorePlain]: treesize reduction 50, result has 59.7 percent of original size [2019-11-22 11:03:36,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-11-22 11:03:36,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-22 11:03:36,879 INFO L567 ElimStorePlain]: treesize reduction 26, result has 72.9 percent of original size [2019-11-22 11:03:36,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:36,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:70 [2019-11-22 11:03:36,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:36,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:37,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:37,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 11:03:37,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:37,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:37,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, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 11:03:37,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:37,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:37,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 11:03:37,927 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:37,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:37,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, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 11:03:37,957 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 11:03:38,006 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 11:03:38,062 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 11:03:38,095 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 11:03:38,113 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,118 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:03:38,118 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-22 11:03:38,139 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-22 11:03:38,158 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 11:03:38,173 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:38,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 11:03:38,189 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:38,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2019-11-22 11:03:38,200 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-11-22 11:03:38,208 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,213 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:03:38,213 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,218 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:03:38,218 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,274 INFO L567 ElimStorePlain]: treesize reduction 267, result has 4.0 percent of original size [2019-11-22 11:03:38,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:38,275 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:669, output treesize:7 [2019-11-22 11:03:38,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:38,671 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-11-22 11:03:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 11:03:38,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:38,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2019-11-22 11:03:38,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640387899] [2019-11-22 11:03:38,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 11:03:38,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 11:03:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:03:38,730 INFO L87 Difference]: Start difference. First operand 448 states and 599 transitions. Second operand 13 states. [2019-11-22 11:03:38,960 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-22 11:03:39,656 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-22 11:03:40,036 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-11-22 11:03:42,077 WARN L192 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-11-22 11:03:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:42,125 INFO L93 Difference]: Finished difference Result 468 states and 606 transitions. [2019-11-22 11:03:42,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:03:42,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-22 11:03:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:42,129 INFO L225 Difference]: With dead ends: 468 [2019-11-22 11:03:42,129 INFO L226 Difference]: Without dead ends: 468 [2019-11-22 11:03:42,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-11-22 11:03:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-22 11:03:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 451. [2019-11-22 11:03:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-22 11:03:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 595 transitions. [2019-11-22 11:03:42,143 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 595 transitions. Word has length 34 [2019-11-22 11:03:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:42,144 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 595 transitions. [2019-11-22 11:03:42,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 11:03:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 595 transitions. [2019-11-22 11:03:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:03:42,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:42,145 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:42,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:42,349 INFO L410 AbstractCegarLoop]: === Iteration 19 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:03:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1389741599, now seen corresponding path program 1 times [2019-11-22 11:03:42,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:42,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031249040] [2019-11-22 11:03:42,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:42,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031249040] [2019-11-22 11:03:42,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969681308] [2019-11-22 11:03:42,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:03:42,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:42,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:42,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 18 [2019-11-22 11:03:42,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956704579] [2019-11-22 11:03:42,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:03:43,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:43,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:03:43,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:03:43,001 INFO L87 Difference]: Start difference. First operand 451 states and 595 transitions. Second operand 6 states. [2019-11-22 11:03:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:43,166 INFO L93 Difference]: Finished difference Result 475 states and 617 transitions. [2019-11-22 11:03:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:03:43,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-22 11:03:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:43,169 INFO L225 Difference]: With dead ends: 475 [2019-11-22 11:03:43,170 INFO L226 Difference]: Without dead ends: 475 [2019-11-22 11:03:43,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-22 11:03:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-22 11:03:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 456. [2019-11-22 11:03:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-22 11:03:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-11-22 11:03:43,187 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 36 [2019-11-22 11:03:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:43,188 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-11-22 11:03:43,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:03:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-11-22 11:03:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 11:03:43,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:43,189 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:43,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:43,402 INFO L410 AbstractCegarLoop]: === Iteration 20 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:03:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1602768999, now seen corresponding path program 1 times [2019-11-22 11:03:43,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:43,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697026850] [2019-11-22 11:03:43,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:44,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697026850] [2019-11-22 11:03:44,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186971336] [2019-11-22 11:03:44,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:44,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:03:44,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:44,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 11:03:44,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:44,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:44,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 11:03:44,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:44,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:44,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:44,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-22 11:03:44,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:44,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-22 11:03:44,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:44,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:44,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-22 11:03:44,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:44,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:44,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:44,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-22 11:03:44,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-22 11:03:44,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:44,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:44,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 11:03:44,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:44,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:44,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:44,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-22 11:03:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:44,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:44,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 26 [2019-11-22 11:03:44,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017200750] [2019-11-22 11:03:44,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 11:03:44,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 11:03:44,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-11-22 11:03:44,600 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 27 states. [2019-11-22 11:03:44,876 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-22 11:03:45,073 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-11-22 11:03:45,938 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-22 11:03:46,131 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-11-22 11:03:47,188 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-22 11:03:47,440 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-22 11:03:47,596 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-22 11:03:47,777 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-11-22 11:03:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:48,144 INFO L93 Difference]: Finished difference Result 504 states and 634 transitions. [2019-11-22 11:03:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-22 11:03:48,144 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-11-22 11:03:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:48,147 INFO L225 Difference]: With dead ends: 504 [2019-11-22 11:03:48,147 INFO L226 Difference]: Without dead ends: 504 [2019-11-22 11:03:48,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=539, Invalid=1717, Unknown=0, NotChecked=0, Total=2256 [2019-11-22 11:03:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-22 11:03:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 457. [2019-11-22 11:03:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-22 11:03:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 593 transitions. [2019-11-22 11:03:48,163 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 593 transitions. Word has length 37 [2019-11-22 11:03:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:48,164 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 593 transitions. [2019-11-22 11:03:48,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 11:03:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 593 transitions. [2019-11-22 11:03:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-22 11:03:48,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:48,165 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:48,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:48,378 INFO L410 AbstractCegarLoop]: === Iteration 21 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:03:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash 304472762, now seen corresponding path program 1 times [2019-11-22 11:03:48,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:48,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774045273] [2019-11-22 11:03:48,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 11:03:48,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774045273] [2019-11-22 11:03:48,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480630318] [2019-11-22 11:03:48,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-22 11:03:48,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:48,962 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 27 [2019-11-22 11:03:48,963 INFO L343 Elim1Store]: treesize reduction 340, result has 12.1 percent of original size [2019-11-22 11:03:48,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 52 [2019-11-22 11:03:48,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:48,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:48,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:03:48,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:48,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:32, output treesize:59 [2019-11-22 11:03:48,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:03:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:03:49,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:03:49,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:03:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:03:50,223 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-22 11:03:50,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:50,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 46 treesize of output 192 [2019-11-22 11:03:50,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:50,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:50,331 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 41 treesize of output 141 [2019-11-22 11:03:50,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:50,335 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:03:50,336 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:50,339 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:03:50,339 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:50,343 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:03:50,343 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:50,346 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:03:50,346 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:50,364 INFO L567 ElimStorePlain]: treesize reduction 32, result has 25.6 percent of original size [2019-11-22 11:03:50,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:50,365 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:252, output treesize:11 [2019-11-22 11:03:50,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:03:50,763 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 81 [2019-11-22 11:03:50,763 INFO L343 Elim1Store]: treesize reduction 80, result has 68.8 percent of original size [2019-11-22 11:03:50,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 46 treesize of output 211 [2019-11-22 11:03:50,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:51,025 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 11:03:51,025 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 11:03:51,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 41 treesize of output 173 [2019-11-22 11:03:51,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:51,274 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 11:03:51,274 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 11:03:51,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 41 treesize of output 173 [2019-11-22 11:03:51,276 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:51,532 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 11:03:51,532 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 11:03:51,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 41 treesize of output 173 [2019-11-22 11:03:51,534 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:51,781 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 11:03:51,782 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 11:03:51,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 41 treesize of output 173 [2019-11-22 11:03:51,784 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:52,006 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 11:03:52,006 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 11:03:52,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 41 treesize of output 173 [2019-11-22 11:03:52,008 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:52,273 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2019-11-22 11:03:52,274 INFO L567 ElimStorePlain]: treesize reduction 480, result has 33.0 percent of original size [2019-11-22 11:03:52,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:52,275 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:252, output treesize:11 [2019-11-22 11:03:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:03:52,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:52,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2019-11-22 11:03:52,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951867397] [2019-11-22 11:03:52,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-22 11:03:52,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-22 11:03:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-11-22 11:03:52,307 INFO L87 Difference]: Start difference. First operand 457 states and 593 transitions. Second operand 20 states. [2019-11-22 11:03:52,496 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-11-22 11:03:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:53,669 INFO L93 Difference]: Finished difference Result 510 states and 629 transitions. [2019-11-22 11:03:53,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 11:03:53,669 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-11-22 11:03:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:53,672 INFO L225 Difference]: With dead ends: 510 [2019-11-22 11:03:53,673 INFO L226 Difference]: Without dead ends: 498 [2019-11-22 11:03:53,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-11-22 11:03:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-22 11:03:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 449. [2019-11-22 11:03:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-22 11:03:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 562 transitions. [2019-11-22 11:03:53,690 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 562 transitions. Word has length 44 [2019-11-22 11:03:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:53,690 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-11-22 11:03:53,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-22 11:03:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 562 transitions. [2019-11-22 11:03:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 11:03:53,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:53,692 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:53,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:53,895 INFO L410 AbstractCegarLoop]: === Iteration 22 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:03:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash 848721050, now seen corresponding path program 1 times [2019-11-22 11:03:53,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:53,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414767277] [2019-11-22 11:03:53,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:54,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414767277] [2019-11-22 11:03:54,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118313018] [2019-11-22 11:03:54,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:03:54,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:55,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-22 11:03:55,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:55,056 INFO L567 ElimStorePlain]: treesize reduction 4, result has 20.0 percent of original size [2019-11-22 11:03:55,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:55,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:1 [2019-11-22 11:03:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:55,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:55,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 27 [2019-11-22 11:03:55,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252071385] [2019-11-22 11:03:55,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 11:03:55,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 11:03:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-11-22 11:03:55,066 INFO L87 Difference]: Start difference. First operand 449 states and 562 transitions. Second operand 27 states. [2019-11-22 11:03:55,359 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-11-22 11:03:55,578 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-11-22 11:03:55,799 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2019-11-22 11:03:56,020 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-11-22 11:03:56,266 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-11-22 11:03:56,691 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-22 11:03:57,025 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-11-22 11:03:57,332 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-22 11:03:57,499 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-11-22 11:03:57,700 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-11-22 11:03:57,885 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-22 11:03:58,074 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-11-22 11:03:58,412 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-22 11:03:58,607 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-22 11:03:58,827 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-22 11:03:58,974 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-11-22 11:03:59,176 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-22 11:03:59,337 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-22 11:03:59,857 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 11:04:00,025 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-22 11:04:00,329 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-22 11:04:00,611 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-11-22 11:04:00,774 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-22 11:04:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:01,154 INFO L93 Difference]: Finished difference Result 703 states and 859 transitions. [2019-11-22 11:04:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-22 11:04:01,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-11-22 11:04:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:01,160 INFO L225 Difference]: With dead ends: 703 [2019-11-22 11:04:01,161 INFO L226 Difference]: Without dead ends: 703 [2019-11-22 11:04:01,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=676, Invalid=2630, Unknown=0, NotChecked=0, Total=3306 [2019-11-22 11:04:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-22 11:04:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 602. [2019-11-22 11:04:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-22 11:04:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 764 transitions. [2019-11-22 11:04:01,182 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 764 transitions. Word has length 45 [2019-11-22 11:04:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:01,183 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 764 transitions. [2019-11-22 11:04:01,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 11:04:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 764 transitions. [2019-11-22 11:04:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 11:04:01,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:01,185 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:04:01,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:04:01,388 INFO L410 AbstractCegarLoop]: === Iteration 23 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:04:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1632248471, now seen corresponding path program 1 times [2019-11-22 11:04:01,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:01,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495175920] [2019-11-22 11:04:01,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:04:01,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495175920] [2019-11-22 11:04:01,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408717893] [2019-11-22 11:04:01,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:04:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-22 11:04:01,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:04:01,977 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 8=[|v_#valid_57|]} [2019-11-22 11:04:01,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:01,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:01,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:01,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:01,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:02,151 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-22 11:04:02,152 INFO L343 Elim1Store]: treesize reduction 86, result has 52.7 percent of original size [2019-11-22 11:04:02,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 11:04:02,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:02,287 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-22 11:04:02,288 INFO L567 ElimStorePlain]: treesize reduction 50, result has 68.6 percent of original size [2019-11-22 11:04:02,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:02,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 239 [2019-11-22 11:04:02,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:02,526 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2019-11-22 11:04:02,527 INFO L567 ElimStorePlain]: treesize reduction 513, result has 16.0 percent of original size [2019-11-22 11:04:02,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:04:02,539 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:98 [2019-11-22 11:04:02,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:02,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:03,015 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 106 [2019-11-22 11:04:03,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 75 [2019-11-22 11:04:03,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2019-11-22 11:04:03,057 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 149 [2019-11-22 11:04:03,178 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:03,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:03,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:03,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 82 [2019-11-22 11:04:03,220 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 106 [2019-11-22 11:04:03,286 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,295 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:03,295 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:03,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 98 [2019-11-22 11:04:03,381 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:03,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:03,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 85 [2019-11-22 11:04:03,418 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2019-11-22 11:04:03,434 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:03,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:03,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2019-11-22 11:04:03,463 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,472 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:03,472 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,478 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:03,478 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:03,677 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-22 11:04:03,678 INFO L567 ElimStorePlain]: treesize reduction 297, result has 33.0 percent of original size [2019-11-22 11:04:03,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:04:03,679 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:951, output treesize:67 [2019-11-22 11:04:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:04,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:04,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:04,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 192 [2019-11-22 11:04:04,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:04,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:05,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:05,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 192 [2019-11-22 11:04:05,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:05,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:05,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:05,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 11:04:05,191 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:05,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:05,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:05,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 138 [2019-11-22 11:04:05,292 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:05,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:05,464 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 11:04:05,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:05,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 200 [2019-11-22 11:04:05,466 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:05,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:05,674 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-22 11:04:05,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:05,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 246 [2019-11-22 11:04:05,677 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:05,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:05,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:05,748 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 100 [2019-11-22 11:04:05,749 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:05,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:05,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:05,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 11:04:05,855 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:05,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:06,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:06,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 188 [2019-11-22 11:04:06,003 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:06,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:06,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:06,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 100 [2019-11-22 11:04:06,071 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:06,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:06,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:06,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 188 [2019-11-22 11:04:06,219 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:06,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:06,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:06,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 11:04:06,322 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:06,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:06,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:06,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 11:04:06,409 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,030 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2019-11-22 11:04:07,030 INFO L567 ElimStorePlain]: treesize reduction 1350, result has 20.5 percent of original size [2019-11-22 11:04:07,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2019-11-22 11:04:07,040 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-11-22 11:04:07,048 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2019-11-22 11:04:07,057 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-11-22 11:04:07,062 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2019-11-22 11:04:07,072 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,278 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-22 11:04:07,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:07,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2019-11-22 11:04:07,285 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-11-22 11:04:07,309 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2019-11-22 11:04:07,314 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-11-22 11:04:07,320 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2019-11-22 11:04:07,334 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:07,492 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-22 11:04:07,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:07,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2019-11-22 11:04:07,516 INFO L221 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:795, output treesize:278 [2019-11-22 11:04:07,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:07,954 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-22 11:04:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:04:08,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:04:08,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-11-22 11:04:08,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138397328] [2019-11-22 11:04:08,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 11:04:08,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:08,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 11:04:08,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-22 11:04:08,075 INFO L87 Difference]: Start difference. First operand 602 states and 764 transitions. Second operand 23 states. [2019-11-22 11:04:09,181 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-11-22 11:04:09,567 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-22 11:04:09,744 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 11:04:10,095 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-11-22 11:04:11,609 WARN L192 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-11-22 11:04:27,129 WARN L192 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 226 DAG size of output: 184 [2019-11-22 11:04:33,158 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-22 11:04:35,774 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-11-22 11:05:03,584 WARN L192 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2019-11-22 11:05:29,358 WARN L192 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-22 11:05:31,911 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-11-22 11:05:34,612 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-22 11:05:43,766 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2019-11-22 11:05:43,939 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-22 11:05:44,449 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 148 [2019-11-22 11:05:45,780 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2019-11-22 11:05:47,793 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-11-22 11:05:58,759 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 169 DAG size of output: 131 [2019-11-22 11:05:59,711 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-22 11:06:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:03,618 INFO L93 Difference]: Finished difference Result 739 states and 890 transitions. [2019-11-22 11:06:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-22 11:06:03,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-22 11:06:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:03,622 INFO L225 Difference]: With dead ends: 739 [2019-11-22 11:06:03,622 INFO L226 Difference]: Without dead ends: 739 [2019-11-22 11:06:03,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 68.2s TimeCoverageRelationStatistics Valid=622, Invalid=2009, Unknown=21, NotChecked=0, Total=2652 [2019-11-22 11:06:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-11-22 11:06:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 648. [2019-11-22 11:06:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-11-22 11:06:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 802 transitions. [2019-11-22 11:06:03,642 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 802 transitions. Word has length 39 [2019-11-22 11:06:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:03,642 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 802 transitions. [2019-11-22 11:06:03,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 11:06:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 802 transitions. [2019-11-22 11:06:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 11:06:03,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:03,643 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:03,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:03,847 INFO L410 AbstractCegarLoop]: === Iteration 24 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash 801064558, now seen corresponding path program 1 times [2019-11-22 11:06:03,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:03,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735023509] [2019-11-22 11:06:03,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:06:04,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735023509] [2019-11-22 11:06:04,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768658305] [2019-11-22 11:06:04,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:04,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-22 11:06:04,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:04,910 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 15=[|v_#valid_58|]} [2019-11-22 11:06:04,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:04,980 INFO L343 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2019-11-22 11:06:04,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 37 [2019-11-22 11:06:04,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:05,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:05,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:05,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 148 [2019-11-22 11:06:05,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:05,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:05,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:05,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:05,171 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-11-22 11:06:05,171 INFO L567 ElimStorePlain]: treesize reduction 283, result has 26.9 percent of original size [2019-11-22 11:06:05,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:06:05,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:104 [2019-11-22 11:06:05,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:05,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 76 [2019-11-22 11:06:05,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:05,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:05,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:05,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:53 [2019-11-22 11:06:05,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:05,957 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:05,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 168 [2019-11-22 11:06:05,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:06,105 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-11-22 11:06:06,106 INFO L567 ElimStorePlain]: treesize reduction 84, result has 61.5 percent of original size [2019-11-22 11:06:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:06:06,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:107, output treesize:134 [2019-11-22 11:06:06,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:06,628 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-22 11:06:07,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:07,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2019-11-22 11:06:07,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:07,441 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-22 11:06:07,442 INFO L567 ElimStorePlain]: treesize reduction 28, result has 84.3 percent of original size [2019-11-22 11:06:07,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2019-11-22 11:06:07,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:07,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:07,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2019-11-22 11:06:07,507 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:07,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:07,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2019-11-22 11:06:07,564 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:07,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:07,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 11:06:07,610 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:208, output treesize:84 [2019-11-22 11:06:07,792 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-22 11:06:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:06:07,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:07,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2019-11-22 11:06:07,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345223950] [2019-11-22 11:06:07,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-22 11:06:07,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-22 11:06:07,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-11-22 11:06:07,826 INFO L87 Difference]: Start difference. First operand 648 states and 802 transitions. Second operand 28 states. [2019-11-22 11:06:08,104 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-22 11:06:08,382 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-11-22 11:06:08,794 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-22 11:06:09,222 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-22 11:06:09,495 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-11-22 11:06:09,759 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-22 11:06:10,363 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-11-22 11:06:10,728 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-22 11:06:11,006 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-22 11:06:11,371 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-11-22 11:06:11,947 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 129 [2019-11-22 11:06:12,763 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-11-22 11:06:13,607 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2019-11-22 11:06:14,222 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-11-22 11:06:14,609 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2019-11-22 11:06:15,379 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-11-22 11:06:15,856 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-22 11:06:16,561 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-22 11:06:16,974 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-22 11:06:17,633 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-11-22 11:06:17,942 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 11:06:18,252 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-22 11:06:18,844 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-22 11:06:19,900 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-11-22 11:06:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:20,096 INFO L93 Difference]: Finished difference Result 716 states and 850 transitions. [2019-11-22 11:06:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-22 11:06:20,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-22 11:06:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:20,101 INFO L225 Difference]: With dead ends: 716 [2019-11-22 11:06:20,101 INFO L226 Difference]: Without dead ends: 716 [2019-11-22 11:06:20,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=884, Invalid=3148, Unknown=0, NotChecked=0, Total=4032 [2019-11-22 11:06:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-22 11:06:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 647. [2019-11-22 11:06:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-22 11:06:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 792 transitions. [2019-11-22 11:06:20,121 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 792 transitions. Word has length 45 [2019-11-22 11:06:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:20,122 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 792 transitions. [2019-11-22 11:06:20,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-22 11:06:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 792 transitions. [2019-11-22 11:06:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-22 11:06:20,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:20,123 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:20,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:20,328 INFO L410 AbstractCegarLoop]: === Iteration 25 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1038016890, now seen corresponding path program 1 times [2019-11-22 11:06:20,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:20,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075122210] [2019-11-22 11:06:20,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 11:06:20,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075122210] [2019-11-22 11:06:20,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884367833] [2019-11-22 11:06:20,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:20,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:06:20,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:20,819 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:06:20,820 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:06:20,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 11:06:20,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:20,874 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 11:06:20,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:20,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:06:20,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 11:06:20,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:20,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:21,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:21,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:21,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:21,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:21,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 11:06:21,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,592 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,593 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,594 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,594 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,594 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,595 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,595 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,596 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,596 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,597 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,597 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:21,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,598 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 11:06:21,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:21,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:21,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 11:06:21,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,892 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,893 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,906 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,906 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,914 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,914 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,922 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,922 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,929 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:21,929 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:21,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:21,931 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 11:06:21,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:22,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 11:06:22,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:22,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 11:06:22,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300605731] [2019-11-22 11:06:22,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:06:22,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:22,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:06:22,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:06:22,147 INFO L87 Difference]: Start difference. First operand 647 states and 792 transitions. Second operand 12 states. [2019-11-22 11:06:22,482 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 11:06:23,312 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 11:06:23,492 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-22 11:06:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:27,683 INFO L93 Difference]: Finished difference Result 686 states and 831 transitions. [2019-11-22 11:06:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:06:27,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-22 11:06:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:27,688 INFO L225 Difference]: With dead ends: 686 [2019-11-22 11:06:27,688 INFO L226 Difference]: Without dead ends: 686 [2019-11-22 11:06:27,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:06:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-22 11:06:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 647. [2019-11-22 11:06:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-22 11:06:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 789 transitions. [2019-11-22 11:06:27,704 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 789 transitions. Word has length 54 [2019-11-22 11:06:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:27,704 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 789 transitions. [2019-11-22 11:06:27,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:06:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 789 transitions. [2019-11-22 11:06:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-22 11:06:27,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:27,706 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:27,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:27,909 INFO L410 AbstractCegarLoop]: === Iteration 26 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1091323427, now seen corresponding path program 1 times [2019-11-22 11:06:27,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:27,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663835705] [2019-11-22 11:06:27,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 11:06:28,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663835705] [2019-11-22 11:06:28,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:06:28,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 11:06:28,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092487690] [2019-11-22 11:06:28,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:06:28,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:06:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:06:28,078 INFO L87 Difference]: Start difference. First operand 647 states and 789 transitions. Second operand 9 states. [2019-11-22 11:06:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:28,520 INFO L93 Difference]: Finished difference Result 397 states and 447 transitions. [2019-11-22 11:06:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:06:28,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-22 11:06:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:28,527 INFO L225 Difference]: With dead ends: 397 [2019-11-22 11:06:28,527 INFO L226 Difference]: Without dead ends: 388 [2019-11-22 11:06:28,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-22 11:06:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-22 11:06:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 365. [2019-11-22 11:06:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-22 11:06:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 416 transitions. [2019-11-22 11:06:28,535 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 416 transitions. Word has length 55 [2019-11-22 11:06:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:28,535 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 416 transitions. [2019-11-22 11:06:28,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:06:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 416 transitions. [2019-11-22 11:06:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-22 11:06:28,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:28,537 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:28,537 INFO L410 AbstractCegarLoop]: === Iteration 27 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1141925511, now seen corresponding path program 1 times [2019-11-22 11:06:28,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:28,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973756939] [2019-11-22 11:06:28,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:06:28,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973756939] [2019-11-22 11:06:28,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605721392] [2019-11-22 11:06:28,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:28,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-22 11:06:28,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:06:28,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:06:28,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-22 11:06:28,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552078930] [2019-11-22 11:06:28,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:06:28,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:06:28,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:06:28,818 INFO L87 Difference]: Start difference. First operand 365 states and 416 transitions. Second operand 4 states. [2019-11-22 11:06:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:28,837 INFO L93 Difference]: Finished difference Result 364 states and 413 transitions. [2019-11-22 11:06:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:06:28,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-22 11:06:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:28,838 INFO L225 Difference]: With dead ends: 364 [2019-11-22 11:06:28,838 INFO L226 Difference]: Without dead ends: 364 [2019-11-22 11:06:28,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:06:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-22 11:06:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2019-11-22 11:06:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-22 11:06:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 413 transitions. [2019-11-22 11:06:28,850 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 413 transitions. Word has length 57 [2019-11-22 11:06:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:28,851 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 413 transitions. [2019-11-22 11:06:28,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:06:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 413 transitions. [2019-11-22 11:06:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-22 11:06:28,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:28,852 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:29,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:29,059 INFO L410 AbstractCegarLoop]: === Iteration 28 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:29,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:29,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2113752430, now seen corresponding path program 1 times [2019-11-22 11:06:29,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:29,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454169195] [2019-11-22 11:06:29,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 11:06:29,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454169195] [2019-11-22 11:06:29,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596079513] [2019-11-22 11:06:29,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:29,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 11:06:29,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:29,545 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:06:29,546 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:06:29,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 11:06:29,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:29,622 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 11:06:29,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:06:29,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:54 [2019-11-22 11:06:29,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:29,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:29,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 11:06:29,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:29,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:29,912 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-22 11:06:29,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:29,962 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:29,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-22 11:06:29,963 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-22 11:06:30,015 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-22 11:06:30,066 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 11:06:30,095 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 11:06:30,108 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,124 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 21 [2019-11-22 11:06:30,125 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,133 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 11:06:30,147 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,157 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 11:06:30,164 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,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 24 [2019-11-22 11:06:30,180 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 11:06:30,197 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,203 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-22 11:06:30,211 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-22 11:06:30,220 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,231 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 11:06:30,245 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,252 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,252 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,255 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,269 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,269 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,270 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,270 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,271 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,278 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 11:06:30,290 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,294 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-22 11:06:30,296 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,304 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,305 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,306 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,311 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,311 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 11:06:30,316 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,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, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 11:06:30,326 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,332 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,332 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,336 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-22 11:06:30,341 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,346 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,347 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,352 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,352 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,357 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,357 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,362 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,362 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,366 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,366 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,409 INFO L567 ElimStorePlain]: treesize reduction 155, result has 4.3 percent of original size [2019-11-22 11:06:30,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,410 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 11:06:30,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 11:06:30,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 11:06:30,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 11:06:30,565 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 11:06:30,579 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,588 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,589 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 11:06:30,600 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,611 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,623 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 24 [2019-11-22 11:06:30,633 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,640 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-22 11:06:30,648 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 11:06:30,661 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,676 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 11:06:30,677 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,683 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,684 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,685 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,688 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,694 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,695 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,695 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,696 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,705 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,706 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,708 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,709 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 11:06:30,714 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:30,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 11:06:30,729 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,734 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,736 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,737 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 11:06:30,748 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,758 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,764 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,766 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,766 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,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, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,769 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,775 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,775 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,776 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,782 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,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 22 treesize of output 13 [2019-11-22 11:06:30,820 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,824 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 11:06:30,829 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,857 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-11-22 11:06:30,869 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 11:06:30,878 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 11:06:30,886 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,892 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,893 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-22 11:06:30,899 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:06:30,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:06:30,908 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-22 11:06:30,911 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,915 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,915 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,919 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,919 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,922 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:30,923 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,947 INFO L567 ElimStorePlain]: treesize reduction 75, result has 8.5 percent of original size [2019-11-22 11:06:30,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:30,947 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 11:06:30,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:30,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:31,236 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 17 [2019-11-22 11:06:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 11:06:31,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:31,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-22 11:06:31,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18876239] [2019-11-22 11:06:31,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:06:31,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:06:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:06:31,276 INFO L87 Difference]: Start difference. First operand 364 states and 413 transitions. Second operand 12 states. [2019-11-22 11:06:31,488 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-22 11:06:32,058 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-22 11:06:32,360 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-22 11:06:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:32,649 INFO L93 Difference]: Finished difference Result 383 states and 430 transitions. [2019-11-22 11:06:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:06:32,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-22 11:06:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:32,652 INFO L225 Difference]: With dead ends: 383 [2019-11-22 11:06:32,652 INFO L226 Difference]: Without dead ends: 376 [2019-11-22 11:06:32,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-22 11:06:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-22 11:06:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2019-11-22 11:06:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-22 11:06:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 403 transitions. [2019-11-22 11:06:32,661 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 403 transitions. Word has length 55 [2019-11-22 11:06:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:32,662 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 403 transitions. [2019-11-22 11:06:32,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:06:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 403 transitions. [2019-11-22 11:06:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-22 11:06:32,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:32,663 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:32,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:32,867 INFO L410 AbstractCegarLoop]: === Iteration 29 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:32,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1039952525, now seen corresponding path program 1 times [2019-11-22 11:06:32,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:32,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877995113] [2019-11-22 11:06:32,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:06:32,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877995113] [2019-11-22 11:06:32,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757236410] [2019-11-22 11:06:32,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:33,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 11:06:33,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:06:33,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:06:33,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-22 11:06:33,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269865619] [2019-11-22 11:06:33,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:06:33,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:06:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:06:33,164 INFO L87 Difference]: Start difference. First operand 357 states and 403 transitions. Second operand 4 states. [2019-11-22 11:06:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:33,222 INFO L93 Difference]: Finished difference Result 356 states and 399 transitions. [2019-11-22 11:06:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:06:33,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-22 11:06:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:33,225 INFO L225 Difference]: With dead ends: 356 [2019-11-22 11:06:33,225 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 11:06:33,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:06:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 11:06:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2019-11-22 11:06:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-22 11:06:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 399 transitions. [2019-11-22 11:06:33,232 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 399 transitions. Word has length 58 [2019-11-22 11:06:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:33,232 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 399 transitions. [2019-11-22 11:06:33,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:06:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 399 transitions. [2019-11-22 11:06:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-22 11:06:33,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:33,234 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:33,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:33,437 INFO L410 AbstractCegarLoop]: === Iteration 30 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2121210039, now seen corresponding path program 1 times [2019-11-22 11:06:33,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:33,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206821109] [2019-11-22 11:06:33,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:06:33,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206821109] [2019-11-22 11:06:33,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395495818] [2019-11-22 11:06:33,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:33,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 11:06:33,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:33,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 11:06:33,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:33,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:33,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:33,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 11:06:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:06:33,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:06:33,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-22 11:06:33,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395671630] [2019-11-22 11:06:33,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:06:33,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:06:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:06:33,721 INFO L87 Difference]: Start difference. First operand 356 states and 399 transitions. Second operand 4 states. [2019-11-22 11:06:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:33,815 INFO L93 Difference]: Finished difference Result 373 states and 411 transitions. [2019-11-22 11:06:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:06:33,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-22 11:06:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:33,822 INFO L225 Difference]: With dead ends: 373 [2019-11-22 11:06:33,822 INFO L226 Difference]: Without dead ends: 367 [2019-11-22 11:06:33,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:06:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-11-22 11:06:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 350. [2019-11-22 11:06:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-22 11:06:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 390 transitions. [2019-11-22 11:06:33,829 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 390 transitions. Word has length 59 [2019-11-22 11:06:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:33,830 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 390 transitions. [2019-11-22 11:06:33,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:06:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 390 transitions. [2019-11-22 11:06:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-22 11:06:33,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:33,831 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:34,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:34,035 INFO L410 AbstractCegarLoop]: === Iteration 31 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2138604831, now seen corresponding path program 1 times [2019-11-22 11:06:34,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:34,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813001966] [2019-11-22 11:06:34,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-22 11:06:34,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813001966] [2019-11-22 11:06:34,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762113708] [2019-11-22 11:06:34,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:34,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-22 11:06:34,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:34,633 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 9=[|v_#valid_61|]} [2019-11-22 11:06:34,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,716 INFO L343 Elim1Store]: treesize reduction 142, result has 12.9 percent of original size [2019-11-22 11:06:34,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 11:06:34,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:34,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:34,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:34,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-22 11:06:34,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:34,821 INFO L567 ElimStorePlain]: treesize reduction 13, result has 82.7 percent of original size [2019-11-22 11:06:34,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:06:34,822 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:62 [2019-11-22 11:06:34,921 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:34,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-22 11:06:34,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:34,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:34,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:34,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 11:06:35,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:35,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-22 11:06:35,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:35,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:35,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:35,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 11:06:35,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:35,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:35,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 120 [2019-11-22 11:06:35,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:35,569 INFO L567 ElimStorePlain]: treesize reduction 60, result has 54.5 percent of original size [2019-11-22 11:06:35,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-22 11:06:35,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:35,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:35,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-22 11:06:35,613 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:35,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:06:35,649 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:58 [2019-11-22 11:06:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-22 11:06:35,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:35,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2019-11-22 11:06:35,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250256702] [2019-11-22 11:06:35,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 11:06:35,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 11:06:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:06:35,924 INFO L87 Difference]: Start difference. First operand 350 states and 390 transitions. Second operand 21 states. [2019-11-22 11:06:36,162 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-22 11:06:36,375 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-22 11:06:36,769 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 11:06:36,985 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-22 11:06:37,386 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-22 11:06:37,715 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-22 11:06:37,969 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-22 11:06:38,410 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-22 11:06:38,734 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2019-11-22 11:06:39,108 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 11:06:39,396 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-22 11:06:39,774 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-22 11:06:40,229 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-22 11:06:41,368 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-11-22 11:06:42,049 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-22 11:06:43,530 WARN L192 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 151 [2019-11-22 11:06:44,686 WARN L192 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-22 11:06:48,464 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-11-22 11:06:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:49,791 INFO L93 Difference]: Finished difference Result 372 states and 405 transitions. [2019-11-22 11:06:49,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-22 11:06:49,793 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-11-22 11:06:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:49,795 INFO L225 Difference]: With dead ends: 372 [2019-11-22 11:06:49,795 INFO L226 Difference]: Without dead ends: 372 [2019-11-22 11:06:49,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=542, Invalid=1714, Unknown=0, NotChecked=0, Total=2256 [2019-11-22 11:06:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-22 11:06:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 349. [2019-11-22 11:06:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-22 11:06:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 384 transitions. [2019-11-22 11:06:49,801 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 384 transitions. Word has length 60 [2019-11-22 11:06:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:49,802 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 384 transitions. [2019-11-22 11:06:49,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 11:06:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 384 transitions. [2019-11-22 11:06:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-22 11:06:49,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:49,805 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:06:50,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:50,007 INFO L410 AbstractCegarLoop]: === Iteration 32 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:06:50,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -201285117, now seen corresponding path program 1 times [2019-11-22 11:06:50,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:50,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183826712] [2019-11-22 11:06:50,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:06:50,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183826712] [2019-11-22 11:06:50,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818851256] [2019-11-22 11:06:50,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:50,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-22 11:06:50,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:50,667 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:06:50,667 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:06:50,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 11:06:50,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:50,720 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 11:06:50,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:50,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:06:50,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 11:06:50,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:50,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:50,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:51,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:51,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:51,841 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:06:51,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:51,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 39 treesize of output 193 [2019-11-22 11:06:51,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,960 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:51,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 11:06:51,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:51,963 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,963 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:51,963 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,964 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:51,964 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,965 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:51,965 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,966 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:06:51,966 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,973 INFO L567 ElimStorePlain]: treesize reduction 29, result has 9.4 percent of original size [2019-11-22 11:06:51,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:51,973 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 11:06:51,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:06:52,150 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:06:52,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:52,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 11:06:52,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:52,324 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:06:52,325 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:52,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 11:06:52,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:52,498 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:06:52,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:52,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 39 treesize of output 193 [2019-11-22 11:06:52,501 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:52,674 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:06:52,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:52,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 11:06:52,676 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:52,919 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 11:06:52,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:52,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 41 treesize of output 249 [2019-11-22 11:06:52,922 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:53,095 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:06:53,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:53,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 11:06:53,097 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:53,243 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:06:53,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:53,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-22 11:06:53,245 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:53,485 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-11-22 11:06:53,486 INFO L567 ElimStorePlain]: treesize reduction 77, result has 62.1 percent of original size [2019-11-22 11:06:53,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:06:53,486 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:261, output treesize:14 [2019-11-22 11:06:53,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 11:06:53,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:53,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:53,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:53,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 11:06:53,541 INFO L343 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2019-11-22 11:06:53,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2019-11-22 11:06:53,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 11:06:53,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:53,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:53,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-22 11:06:53,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 11:06:53,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:53,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-22 11:06:53,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402687185] [2019-11-22 11:06:53,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-22 11:06:53,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-22 11:06:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-22 11:06:53,613 INFO L87 Difference]: Start difference. First operand 349 states and 384 transitions. Second operand 20 states. [2019-11-22 11:07:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:29,222 INFO L93 Difference]: Finished difference Result 376 states and 408 transitions. [2019-11-22 11:07:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:07:29,222 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2019-11-22 11:07:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:29,224 INFO L225 Difference]: With dead ends: 376 [2019-11-22 11:07:29,224 INFO L226 Difference]: Without dead ends: 376 [2019-11-22 11:07:29,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-11-22 11:07:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-22 11:07:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 348. [2019-11-22 11:07:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-22 11:07:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 383 transitions. [2019-11-22 11:07:29,232 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 383 transitions. Word has length 70 [2019-11-22 11:07:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:29,232 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 383 transitions. [2019-11-22 11:07:29,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-22 11:07:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 383 transitions. [2019-11-22 11:07:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-22 11:07:29,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:29,234 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:07:29,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:29,435 INFO L410 AbstractCegarLoop]: === Iteration 33 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:07:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1944871311, now seen corresponding path program 1 times [2019-11-22 11:07:29,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:07:29,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454799186] [2019-11-22 11:07:29,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:07:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-22 11:07:30,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454799186] [2019-11-22 11:07:30,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878774592] [2019-11-22 11:07:30,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:30,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-22 11:07:30,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:30,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 11:07:30,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-22 11:07:30,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-22 11:07:30,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-22 11:07:30,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 11:07:30,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2019-11-22 11:07:31,030 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:31,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-22 11:07:31,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,060 INFO L567 ElimStorePlain]: treesize reduction 18, result has 61.7 percent of original size [2019-11-22 11:07:31,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:29 [2019-11-22 11:07:31,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:31,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-22 11:07:31,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,357 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-22 11:07:31,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:07:31,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-22 11:07:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 11:07:31,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:07:31,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2019-11-22 11:07:31,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47462684] [2019-11-22 11:07:31,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-22 11:07:31,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:07:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-22 11:07:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2019-11-22 11:07:31,423 INFO L87 Difference]: Start difference. First operand 348 states and 383 transitions. Second operand 43 states. [2019-11-22 11:07:31,691 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-22 11:07:31,882 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-22 11:07:32,077 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-11-22 11:07:32,393 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-22 11:07:33,107 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-22 11:07:33,265 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-11-22 11:07:33,442 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-11-22 11:07:33,641 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 11:07:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:34,931 INFO L93 Difference]: Finished difference Result 391 states and 421 transitions. [2019-11-22 11:07:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 11:07:34,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2019-11-22 11:07:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:34,934 INFO L225 Difference]: With dead ends: 391 [2019-11-22 11:07:34,935 INFO L226 Difference]: Without dead ends: 391 [2019-11-22 11:07:34,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=570, Invalid=3090, Unknown=0, NotChecked=0, Total=3660 [2019-11-22 11:07:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-22 11:07:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 348. [2019-11-22 11:07:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-22 11:07:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 382 transitions. [2019-11-22 11:07:34,943 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 382 transitions. Word has length 71 [2019-11-22 11:07:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:34,944 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 382 transitions. [2019-11-22 11:07:34,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-22 11:07:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 382 transitions. [2019-11-22 11:07:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-22 11:07:34,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:34,945 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:07:35,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:35,163 INFO L410 AbstractCegarLoop]: === Iteration 34 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:07:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:35,164 INFO L82 PathProgramCache]: Analyzing trace with hash -710553421, now seen corresponding path program 1 times [2019-11-22 11:07:35,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:07:35,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595356095] [2019-11-22 11:07:35,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:07:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-22 11:07:35,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595356095] [2019-11-22 11:07:35,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078322614] [2019-11-22 11:07:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:35,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-22 11:07:35,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:36,080 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:07:36,081 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:07:36,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 11:07:36,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,162 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-11-22 11:07:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:36,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:07:36,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:58 [2019-11-22 11:07:36,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:36,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:36,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:36,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:36,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:36,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:36,768 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 37 treesize of output 145 [2019-11-22 11:07:36,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,772 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:36,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,776 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:36,776 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,780 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:36,780 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,783 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:36,783 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,787 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:36,787 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,789 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:36,789 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:36,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:36,795 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:271, output treesize:7 [2019-11-22 11:07:36,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:36,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:37,111 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:07:37,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:37,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 11:07:37,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:37,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:37,361 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:07:37,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:37,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 11:07:37,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:37,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:37,700 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-22 11:07:37,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:37,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 47 treesize of output 319 [2019-11-22 11:07:37,704 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:37,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:37,945 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:07:37,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:37,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 11:07:37,948 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:37,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:38,184 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:07:38,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:38,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 252 [2019-11-22 11:07:38,187 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:38,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:38,437 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:07:38,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:38,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 11:07:38,440 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:38,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:38,653 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:07:38,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:38,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 252 [2019-11-22 11:07:38,655 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:39,072 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-11-22 11:07:39,073 INFO L567 ElimStorePlain]: treesize reduction 718, result has 26.5 percent of original size [2019-11-22 11:07:39,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-22 11:07:39,074 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:306, output treesize:89 [2019-11-22 11:07:39,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:39,197 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:39,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 64 [2019-11-22 11:07:39,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:39,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:39,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:39,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:39,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 64 [2019-11-22 11:07:39,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:39,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:39,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:07:39,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:23 [2019-11-22 11:07:39,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 11:07:39,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:39,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:39,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:39,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 11:07:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:39,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:39,487 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-22 11:07:39,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 98 [2019-11-22 11:07:39,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:39,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:39,595 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-22 11:07:39,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 98 [2019-11-22 11:07:39,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:39,717 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2019-11-22 11:07:39,717 INFO L567 ElimStorePlain]: treesize reduction 76, result has 44.5 percent of original size [2019-11-22 11:07:39,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:39,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-22 11:07:39,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-11-22 11:07:39,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:39,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:39,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:39,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 11:07:39,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:07:39,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2019-11-22 11:07:39,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93168739] [2019-11-22 11:07:39,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-22 11:07:39,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:07:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-22 11:07:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2019-11-22 11:07:39,961 INFO L87 Difference]: Start difference. First operand 348 states and 382 transitions. Second operand 28 states. [2019-11-22 11:07:40,337 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-11-22 11:07:40,648 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-11-22 11:07:41,850 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-11-22 11:07:42,126 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-11-22 11:07:42,765 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 101 [2019-11-22 11:07:43,077 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 108 [2019-11-22 11:07:43,608 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-11-22 11:07:43,869 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-22 11:07:44,464 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-11-22 11:07:44,877 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-22 11:07:45,599 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-11-22 11:07:45,995 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 111 [2019-11-22 11:07:46,632 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 111 [2019-11-22 11:07:46,887 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2019-11-22 11:07:47,380 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-22 11:07:48,355 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-11-22 11:07:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:49,783 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-11-22 11:07:49,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-22 11:07:49,784 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2019-11-22 11:07:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:49,785 INFO L225 Difference]: With dead ends: 376 [2019-11-22 11:07:49,785 INFO L226 Difference]: Without dead ends: 376 [2019-11-22 11:07:49,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=572, Invalid=2850, Unknown=0, NotChecked=0, Total=3422 [2019-11-22 11:07:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-22 11:07:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 347. [2019-11-22 11:07:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-22 11:07:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 381 transitions. [2019-11-22 11:07:49,791 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 381 transitions. Word has length 73 [2019-11-22 11:07:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:49,792 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 381 transitions. [2019-11-22 11:07:49,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-22 11:07:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 381 transitions. [2019-11-22 11:07:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-22 11:07:49,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:49,793 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:07:49,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:49,999 INFO L410 AbstractCegarLoop]: === Iteration 35 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:07:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash -148206892, now seen corresponding path program 1 times [2019-11-22 11:07:50,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:07:50,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667690029] [2019-11-22 11:07:50,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:07:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 11:07:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 11:07:50,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-22 11:07:50,111 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-22 11:07:50,180 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-22 11:07:50,193 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-22 11:07:50,194 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-22 11:07:50,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:07:50 BoogieIcfgContainer [2019-11-22 11:07:50,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:07:50,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:07:50,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:07:50,257 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:07:50,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:36" (3/4) ... [2019-11-22 11:07:50,260 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-22 11:07:50,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:07:50,262 INFO L168 Benchmark]: Toolchain (without parser) took 375073.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -93.7 MB). Peak memory consumption was 205.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:07:50,262 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:07:50,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-22 11:07:50,262 INFO L168 Benchmark]: Boogie Preprocessor took 85.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:07:50,263 INFO L168 Benchmark]: RCFGBuilder took 765.74 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: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:07:50,263 INFO L168 Benchmark]: TraceAbstraction took 373521.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -10.0 MB). Peak memory consumption was 150.9 MB. Max. memory is 11.5 GB. [2019-11-22 11:07:50,263 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:07:50,264 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.30 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 689.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.61 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 765.74 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: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 373521.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -10.0 MB). Peak memory consumption was 150.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [\old(commands)=null, \old(commands)=null, \old(global)=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}] [L708] global = x [L709] state = STATE_2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, malloc(sizeof(char))={1:0}, state=1, x={1:0}] [L695] RET commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={1:0}, i=0, input={10:0}, input={10:0}, state=1] [L724] RET parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, state=1] [L725] return 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, \result=0, commands={7:0}, global={1:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 79 locations, 20 error locations. Result: UNSAFE, OverallTime: 373.4s, OverallIterations: 35, TraceHistogramMax: 5, AutomataDifference: 292.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1657 SDtfs, 12171 SDslu, 3236 SDs, 0 SdLazy, 17259 SolverSat, 4144 SolverUnsat, 59 SolverUnknown, 0 SolverNotchecked, 123.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1725 GetRequests, 930 SyntacticMatches, 79 SemanticMatches, 716 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7161 ImplicationChecksByTransitivity, 160.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=648occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 1114 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 71.4s InterpolantComputationTime, 2274 NumberOfCodeBlocks, 2274 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2144 ConstructedInterpolants, 210 QuantifiedInterpolants, 1742487 SizeOfPredicates, 216 NumberOfNonLiveVariables, 7779 ConjunctsInSsa, 564 ConjunctsInUnsatCore, 55 InterpolantComputations, 17 PerfectInterpolantSequences, 660/1142 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-5a07968 [2019-11-22 11:07:52,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:07:52,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:07:52,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:07:52,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:07:52,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:07:52,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:07:52,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:07:52,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:07:52,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:07:52,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:07:52,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:07:52,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:07:52,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:07:52,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:07:52,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:07:52,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:07:52,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:07:52,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:07:52,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:07:52,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:07:52,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:07:52,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:07:52,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:07:52,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:07:52,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:07:52,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:07:52,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:07:52,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:07:52,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:07:52,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:07:52,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:07:52,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:07:52,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:07:52,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:07:52,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:07:52,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:07:52,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:07:52,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:07:52,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:07:52,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:07:52,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 11:07:52,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:07:52,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:07:52,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:07:52,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:07:52,235 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:07:52,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:07:52,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:07:52,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:07:52,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:07:52,237 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:07:52,237 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:07:52,237 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:07:52,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:07:52,239 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:07:52,239 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 11:07:52,239 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 11:07:52,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:07:52,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:07:52,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:07:52,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:07:52,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:07:52,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:07:52,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:07:52,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:07:52,243 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 11:07:52,243 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 11:07:52,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 11:07:52,243 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b34e199f0da2018b0ae97fc3f9a24725315a1b16 [2019-11-22 11:07:52,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:07:52,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:07:52,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:07:52,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:07:52,579 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:07:52,580 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 11:07:52,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89365d655/9524e266386042aaba8048fd3359cc1c/FLAG366b3dcba [2019-11-22 11:07:53,125 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:07:53,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 11:07:53,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89365d655/9524e266386042aaba8048fd3359cc1c/FLAG366b3dcba [2019-11-22 11:07:53,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89365d655/9524e266386042aaba8048fd3359cc1c [2019-11-22 11:07:53,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:07:53,504 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:07:53,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:07:53,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:07:53,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:07:53,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:07:53" (1/1) ... [2019-11-22 11:07:53,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6865c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:53, skipping insertion in model container [2019-11-22 11:07:53,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:07:53" (1/1) ... [2019-11-22 11:07:53,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:07:53,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:07:54,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:07:54,052 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:07:54,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:07:54,245 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:07:54,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54 WrapperNode [2019-11-22 11:07:54,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:07:54,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:07:54,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:07:54,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:07:54,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... [2019-11-22 11:07:54,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... [2019-11-22 11:07:54,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... [2019-11-22 11:07:54,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... [2019-11-22 11:07:54,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... [2019-11-22 11:07:54,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... [2019-11-22 11:07:54,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... [2019-11-22 11:07:54,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:07:54,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:07:54,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:07:54,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:07:54,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:07:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:07:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:07:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 11:07:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 11:07:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 11:07:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 11:07:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 11:07:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 11:07:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 11:07:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:07:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 11:07:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 11:07:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 11:07:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 11:07:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 11:07:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 11:07:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 11:07:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 11:07:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 11:07:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 11:07:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 11:07:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 11:07:54,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 11:07:54,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 11:07:54,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 11:07:54,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 11:07:54,418 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 11:07:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 11:07:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 11:07:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 11:07:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 11:07:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 11:07:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 11:07:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 11:07:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 11:07:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 11:07:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 11:07:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 11:07:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 11:07:54,422 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 11:07:54,422 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 11:07:54,422 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 11:07:54,422 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 11:07:54,422 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 11:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 11:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 11:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 11:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 11:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 11:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 11:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 11:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 11:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 11:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 11:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 11:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 11:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 11:07:54,426 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 11:07:54,426 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 11:07:54,426 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 11:07:54,426 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 11:07:54,426 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 11:07:54,427 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 11:07:54,427 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 11:07:54,427 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 11:07:54,427 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 11:07:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 11:07:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 11:07:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 11:07:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 11:07:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 11:07:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 11:07:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 11:07:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 11:07:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 11:07:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 11:07:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 11:07:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 11:07:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 11:07:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 11:07:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 11:07:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 11:07:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 11:07:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 11:07:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 11:07:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 11:07:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 11:07:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 11:07:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 11:07:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 11:07:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 11:07:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 11:07:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 11:07:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 11:07:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 11:07:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 11:07:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 11:07:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 11:07:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 11:07:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 11:07:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 11:07:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 11:07:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 11:07:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 11:07:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 11:07:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 11:07:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 11:07:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 11:07:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 11:07:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 11:07:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 11:07:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 11:07:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 11:07:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 11:07:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 11:07:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 11:07:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 11:07:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 11:07:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 11:07:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 11:07:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 11:07:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 11:07:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 11:07:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 11:07:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 11:07:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:07:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 11:07:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 11:07:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 11:07:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 11:07:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:07:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:07:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:07:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:07:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 11:07:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 11:07:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:07:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 11:07:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 11:07:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 11:07:55,201 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:07:55,201 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 11:07:55,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:07:55 BoogieIcfgContainer [2019-11-22 11:07:55,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:07:55,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:07:55,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:07:55,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:07:55,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:07:53" (1/3) ... [2019-11-22 11:07:55,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6147bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:07:55, skipping insertion in model container [2019-11-22 11:07:55,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:07:54" (2/3) ... [2019-11-22 11:07:55,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6147bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:07:55, skipping insertion in model container [2019-11-22 11:07:55,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:07:55" (3/3) ... [2019-11-22 11:07:55,213 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-22 11:07:55,223 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:07:55,231 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 11:07:55,243 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 11:07:55,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:07:55,262 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:07:55,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:07:55,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:07:55,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:07:55,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:07:55,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:07:55,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:07:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 11:07:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:07:55,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:55,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:07:55,292 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:07:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 11:07:55,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:07:55,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1749022455] [2019-11-22 11:07:55,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:07:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:55,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 11:07:55,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:56,103 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 11:07:56,106 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:07:56,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 11:07:56,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:56,210 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 11:07:56,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:56,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:07:56,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 11:07:56,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:07:56,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:07:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:07:56,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1749022455] [2019-11-22 11:07:56,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:07:56,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 11:07:56,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41227671] [2019-11-22 11:07:56,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:07:56,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:07:56,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:07:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:07:56,353 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 11:07:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:56,508 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-22 11:07:56,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:07:56,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 11:07:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:56,521 INFO L225 Difference]: With dead ends: 88 [2019-11-22 11:07:56,521 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 11:07:56,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:07:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 11:07:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-11-22 11:07:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-22 11:07:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-22 11:07:56,582 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 9 [2019-11-22 11:07:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:56,583 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-22 11:07:56,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:07:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-22 11:07:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:07:56,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:56,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:07:56,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:07:56,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:07:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 11:07:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:07:56,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2066441851] [2019-11-22 11:07:56,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:07:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:57,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 11:07:57,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:57,540 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:07:57,542 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:07:57,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 11:07:57,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:57,689 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 11:07:57,690 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 11:07:57,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:57,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 11:07:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:07:57,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:07:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:07:57,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2066441851] [2019-11-22 11:07:57,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:07:57,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 11:07:57,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821814999] [2019-11-22 11:07:57,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:07:57,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:07:57,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:07:57,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:07:57,965 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2019-11-22 11:07:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:58,655 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2019-11-22 11:07:58,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:07:58,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 11:07:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:58,658 INFO L225 Difference]: With dead ends: 164 [2019-11-22 11:07:58,658 INFO L226 Difference]: Without dead ends: 164 [2019-11-22 11:07:58,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:07:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-22 11:07:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2019-11-22 11:07:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-22 11:07:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2019-11-22 11:07:58,686 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 9 [2019-11-22 11:07:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:58,689 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2019-11-22 11:07:58,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:07:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2019-11-22 11:07:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:07:58,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:58,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:07:58,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:07:58,892 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:07:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 11:07:58,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:07:58,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1626510525] [2019-11-22 11:07:58,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:07:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:59,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 11:07:59,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:59,942 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 11:07:59,944 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 11:07:59,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 325 treesize of output 419 [2019-11-22 11:07:59,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:59,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:00,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:01,079 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-22 11:08:01,080 INFO L567 ElimStorePlain]: treesize reduction 6909, result has 2.3 percent of original size [2019-11-22 11:08:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:01,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:01,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 11:08:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:01,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:01,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:01,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:01,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:01,646 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-11-22 11:08:01,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 44 [2019-11-22 11:08:01,675 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:01,800 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-22 11:08:01,800 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.3 percent of original size [2019-11-22 11:08:01,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:01,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:124, output treesize:70 [2019-11-22 11:08:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:01,869 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:02,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1626510525] [2019-11-22 11:08:02,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:02,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 11:08:02,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127304932] [2019-11-22 11:08:02,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:08:02,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:08:02,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:08:02,237 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand 8 states. [2019-11-22 11:08:02,448 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-22 11:08:02,713 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 11:08:03,073 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-11-22 11:08:03,752 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-11-22 11:08:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:04,343 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2019-11-22 11:08:04,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:08:04,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 11:08:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:04,349 INFO L225 Difference]: With dead ends: 277 [2019-11-22 11:08:04,349 INFO L226 Difference]: Without dead ends: 277 [2019-11-22 11:08:04,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:08:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-22 11:08:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 205. [2019-11-22 11:08:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-22 11:08:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2019-11-22 11:08:04,396 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 10 [2019-11-22 11:08:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:04,397 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2019-11-22 11:08:04,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:08:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2019-11-22 11:08:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 11:08:04,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:04,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:04,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:04,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, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 11:08:04,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:04,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [20892904] [2019-11-22 11:08:04,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:05,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 11:08:05,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:05,073 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 11:08:05,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:05,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:05,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:05,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:05,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:05,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:05,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:05,401 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 11:08:05,402 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 11:08:05,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 141 [2019-11-22 11:08:05,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:05,643 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 11:08:05,643 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 11:08:05,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:05,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 288 [2019-11-22 11:08:05,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:05,795 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,632 WARN L192 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 68 [2019-11-22 11:08:06,633 INFO L567 ElimStorePlain]: treesize reduction 2940, result has 5.0 percent of original size [2019-11-22 11:08:06,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:06,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 11:08:06,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:06,807 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:08:06,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:06,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2019-11-22 11:08:06,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:06,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 11:08:06,865 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:08:06,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 11:08:06,890 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:06,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2019-11-22 11:08:06,914 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:06,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 11:08:06,940 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,949 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:08:06,949 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 11:08:06,982 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:06,992 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:08:06,993 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:07,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 11:08:07,018 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:07,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:07,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 131 [2019-11-22 11:08:07,049 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:07,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:07,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 11:08:07,075 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:07,574 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 11:08:07,575 INFO L567 ElimStorePlain]: treesize reduction 698, result has 31.2 percent of original size [2019-11-22 11:08:07,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 11:08:07,577 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1531, output treesize:316 [2019-11-22 11:08:07,847 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 11:08:08,104 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 11:08:08,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:08:08,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 0 case distinctions, treesize of input 81 treesize of output 61 [2019-11-22 11:08:08,172 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:08,404 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 11:08:08,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:08,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2019-11-22 11:08:08,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:08,606 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-22 11:08:08,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:08,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2019-11-22 11:08:08,623 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:08,776 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 11:08:08,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:08,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2019-11-22 11:08:08,788 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:08,924 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 11:08:08,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:08,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-11-22 11:08:08,942 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:09,085 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 11:08:09,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:09,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2019-11-22 11:08:09,097 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:09,217 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-22 11:08:09,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:09,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 11:08:09,220 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:249, output treesize:129 [2019-11-22 11:08:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:09,348 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:09,596 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 11:08:09,832 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 11:08:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:09,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20892904] [2019-11-22 11:08:09,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:09,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 11:08:09,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803525868] [2019-11-22 11:08:09,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:08:09,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:08:09,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:08:09,951 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand 9 states. [2019-11-22 11:08:10,269 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-11-22 11:08:10,681 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 91 [2019-11-22 11:08:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:12,429 INFO L93 Difference]: Finished difference Result 355 states and 474 transitions. [2019-11-22 11:08:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:08:12,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 11:08:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:12,433 INFO L225 Difference]: With dead ends: 355 [2019-11-22 11:08:12,434 INFO L226 Difference]: Without dead ends: 355 [2019-11-22 11:08:12,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 11:08:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-22 11:08:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 290. [2019-11-22 11:08:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-22 11:08:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 436 transitions. [2019-11-22 11:08:12,461 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 436 transitions. Word has length 11 [2019-11-22 11:08:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:12,462 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 436 transitions. [2019-11-22 11:08:12,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:08:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2019-11-22 11:08:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 11:08:12,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:12,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:12,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:12,668 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 11:08:12,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:12,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1825699638] [2019-11-22 11:08:12,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:13,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:08:13,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:13,419 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 11:08:13,420 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 11:08:13,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1568 treesize of output 1562 [2019-11-22 11:08:13,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:13,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:14,758 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 229 DAG size of output: 64 [2019-11-22 11:08:14,760 INFO L567 ElimStorePlain]: treesize reduction 58523, result has 0.2 percent of original size [2019-11-22 11:08:14,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:14,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:14,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 11:08:14,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:14,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:15,315 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 11:08:15,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-22 11:08:15,491 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:15,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1825699638] [2019-11-22 11:08:15,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:15,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 11:08:15,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890129502] [2019-11-22 11:08:15,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:08:15,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:15,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:08:15,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:08:15,759 INFO L87 Difference]: Start difference. First operand 290 states and 436 transitions. Second operand 10 states. [2019-11-22 11:08:16,823 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 11:08:17,889 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 11:08:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:18,899 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2019-11-22 11:08:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:08:18,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 11:08:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:18,903 INFO L225 Difference]: With dead ends: 373 [2019-11-22 11:08:18,904 INFO L226 Difference]: Without dead ends: 373 [2019-11-22 11:08:18,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:08:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-22 11:08:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 313. [2019-11-22 11:08:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-22 11:08:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 458 transitions. [2019-11-22 11:08:18,931 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 458 transitions. Word has length 12 [2019-11-22 11:08:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:18,931 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 458 transitions. [2019-11-22 11:08:18,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:08:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 458 transitions. [2019-11-22 11:08:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 11:08:18,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:18,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:19,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:19,138 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:19,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 11:08:19,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:19,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1061344228] [2019-11-22 11:08:19,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:19,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:08:19,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:19,574 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 11:08:19,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,644 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 11:08:19,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 11:08:19,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:19,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:19,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:19,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:19,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2019-11-22 11:08:19,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:19,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:19,989 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-22 11:08:19,990 INFO L567 ElimStorePlain]: treesize reduction 166, result has 27.2 percent of original size [2019-11-22 11:08:19,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:19,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 11:08:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:20,190 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:20,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1061344228] [2019-11-22 11:08:20,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:20,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 11:08:20,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600167110] [2019-11-22 11:08:20,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:08:20,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:08:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:08:20,547 INFO L87 Difference]: Start difference. First operand 313 states and 458 transitions. Second operand 8 states. [2019-11-22 11:08:20,794 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-22 11:08:24,597 WARN L192 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 11:08:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:25,619 INFO L93 Difference]: Finished difference Result 372 states and 471 transitions. [2019-11-22 11:08:25,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:08:25,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 11:08:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:25,623 INFO L225 Difference]: With dead ends: 372 [2019-11-22 11:08:25,623 INFO L226 Difference]: Without dead ends: 372 [2019-11-22 11:08:25,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:08:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-22 11:08:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2019-11-22 11:08:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-22 11:08:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 453 transitions. [2019-11-22 11:08:25,640 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 453 transitions. Word has length 13 [2019-11-22 11:08:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:25,641 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 453 transitions. [2019-11-22 11:08:25,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:08:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 453 transitions. [2019-11-22 11:08:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 11:08:25,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:25,642 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:25,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:25,847 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:25,847 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 11:08:25,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:25,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1665924531] [2019-11-22 11:08:25,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:26,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 11:08:26,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:26,402 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 15=[|v_#valid_93|]} [2019-11-22 11:08:26,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:26,725 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-22 11:08:26,726 INFO L343 Elim1Store]: treesize reduction 28, result has 81.1 percent of original size [2019-11-22 11:08:26,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 11:08:26,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:26,937 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-22 11:08:26,938 INFO L567 ElimStorePlain]: treesize reduction 62, result has 69.9 percent of original size [2019-11-22 11:08:27,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:27,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 402 [2019-11-22 11:08:27,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:27,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:28,287 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 248 DAG size of output: 64 [2019-11-22 11:08:28,287 INFO L567 ElimStorePlain]: treesize reduction 7690, result has 1.6 percent of original size [2019-11-22 11:08:28,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:28,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:109, output treesize:129 [2019-11-22 11:08:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:28,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:29,036 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-22 11:08:29,589 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 11:08:29,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:29,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2019-11-22 11:08:29,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:30,081 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-11-22 11:08:30,082 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.9 percent of original size [2019-11-22 11:08:30,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2019-11-22 11:08:30,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:30,275 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-22 11:08:30,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:30,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2019-11-22 11:08:30,297 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:30,451 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-22 11:08:30,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:30,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-22 11:08:30,465 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:30,611 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-22 11:08:30,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:30,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 11:08:30,613 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:195, output treesize:92 [2019-11-22 11:08:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:30,760 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:31,399 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-22 11:08:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:31,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1665924531] [2019-11-22 11:08:31,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:08:31,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-22 11:08:31,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86210670] [2019-11-22 11:08:31,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:08:31,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:08:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:08:31,417 INFO L87 Difference]: Start difference. First operand 314 states and 453 transitions. Second operand 10 states. [2019-11-22 11:08:31,867 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-22 11:08:32,598 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-22 11:08:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:35,100 INFO L93 Difference]: Finished difference Result 442 states and 590 transitions. [2019-11-22 11:08:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:08:35,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 11:08:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:35,108 INFO L225 Difference]: With dead ends: 442 [2019-11-22 11:08:35,108 INFO L226 Difference]: Without dead ends: 442 [2019-11-22 11:08:35,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:08:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-22 11:08:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 343. [2019-11-22 11:08:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 11:08:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 492 transitions. [2019-11-22 11:08:35,138 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 492 transitions. Word has length 19 [2019-11-22 11:08:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:35,138 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 492 transitions. [2019-11-22 11:08:35,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:08:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 492 transitions. [2019-11-22 11:08:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:08:35,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:35,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:35,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:35,350 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602239, now seen corresponding path program 1 times [2019-11-22 11:08:35,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:35,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [139254260] [2019-11-22 11:08:35,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:35,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 11:08:35,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:35,627 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:35,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [139254260] [2019-11-22 11:08:35,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:35,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 11:08:35,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398628101] [2019-11-22 11:08:35,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:08:35,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:08:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:08:35,639 INFO L87 Difference]: Start difference. First operand 343 states and 492 transitions. Second operand 3 states. [2019-11-22 11:08:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:35,660 INFO L93 Difference]: Finished difference Result 504 states and 738 transitions. [2019-11-22 11:08:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:08:35,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 11:08:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:35,666 INFO L225 Difference]: With dead ends: 504 [2019-11-22 11:08:35,666 INFO L226 Difference]: Without dead ends: 504 [2019-11-22 11:08:35,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:08:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-22 11:08:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 487. [2019-11-22 11:08:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-22 11:08:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 730 transitions. [2019-11-22 11:08:35,693 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 730 transitions. Word has length 23 [2019-11-22 11:08:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:35,694 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 730 transitions. [2019-11-22 11:08:35,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:08:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 730 transitions. [2019-11-22 11:08:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:08:35,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:35,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:35,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:35,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602463, now seen corresponding path program 1 times [2019-11-22 11:08:35,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:35,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1632551563] [2019-11-22 11:08:35,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:36,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 11:08:36,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:36,175 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:36,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1632551563] [2019-11-22 11:08:36,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:36,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 11:08:36,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852684686] [2019-11-22 11:08:36,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:08:36,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:08:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:08:36,184 INFO L87 Difference]: Start difference. First operand 487 states and 730 transitions. Second operand 3 states. [2019-11-22 11:08:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:36,193 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-11-22 11:08:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:08:36,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 11:08:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:36,197 INFO L225 Difference]: With dead ends: 455 [2019-11-22 11:08:36,197 INFO L226 Difference]: Without dead ends: 455 [2019-11-22 11:08:36,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:08:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-22 11:08:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-22 11:08:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-22 11:08:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 676 transitions. [2019-11-22 11:08:36,215 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 676 transitions. Word has length 23 [2019-11-22 11:08:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:36,216 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 676 transitions. [2019-11-22 11:08:36,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:08:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 676 transitions. [2019-11-22 11:08:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 11:08:36,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:36,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:36,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:36,421 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash -494938069, now seen corresponding path program 1 times [2019-11-22 11:08:36,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:36,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2106078702] [2019-11-22 11:08:36,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:36,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 11:08:36,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:36,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:36,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2106078702] [2019-11-22 11:08:36,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:36,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 11:08:36,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721803005] [2019-11-22 11:08:36,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:08:36,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:08:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:08:36,740 INFO L87 Difference]: Start difference. First operand 455 states and 676 transitions. Second operand 4 states. [2019-11-22 11:08:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:36,898 INFO L93 Difference]: Finished difference Result 546 states and 773 transitions. [2019-11-22 11:08:36,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:08:36,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 11:08:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:36,903 INFO L225 Difference]: With dead ends: 546 [2019-11-22 11:08:36,903 INFO L226 Difference]: Without dead ends: 546 [2019-11-22 11:08:36,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:08:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-22 11:08:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 515. [2019-11-22 11:08:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-22 11:08:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 756 transitions. [2019-11-22 11:08:36,927 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 756 transitions. Word has length 24 [2019-11-22 11:08:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:36,928 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 756 transitions. [2019-11-22 11:08:36,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:08:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 756 transitions. [2019-11-22 11:08:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:08:36,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:36,935 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:37,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:37,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 11:08:37,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:37,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [173600834] [2019-11-22 11:08:37,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:37,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 11:08:37,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:37,532 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:37,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [173600834] [2019-11-22 11:08:37,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:08:37,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 11:08:37,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673854507] [2019-11-22 11:08:37,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:08:37,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:37,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:08:37,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:08:37,578 INFO L87 Difference]: Start difference. First operand 515 states and 756 transitions. Second operand 8 states. [2019-11-22 11:08:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:37,735 INFO L93 Difference]: Finished difference Result 535 states and 764 transitions. [2019-11-22 11:08:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:08:37,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 11:08:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:37,740 INFO L225 Difference]: With dead ends: 535 [2019-11-22 11:08:37,740 INFO L226 Difference]: Without dead ends: 535 [2019-11-22 11:08:37,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:08:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-11-22 11:08:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 462. [2019-11-22 11:08:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-22 11:08:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 634 transitions. [2019-11-22 11:08:37,761 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 634 transitions. Word has length 25 [2019-11-22 11:08:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:37,761 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 634 transitions. [2019-11-22 11:08:37,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:08:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 634 transitions. [2019-11-22 11:08:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:08:37,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:37,763 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:37,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:37,968 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash -71787967, now seen corresponding path program 1 times [2019-11-22 11:08:37,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:37,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [727056097] [2019-11-22 11:08:37,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:38,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 11:08:38,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:38,268 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:38,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [727056097] [2019-11-22 11:08:38,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:08:38,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 11:08:38,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501007149] [2019-11-22 11:08:38,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:08:38,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:08:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:08:38,308 INFO L87 Difference]: Start difference. First operand 462 states and 634 transitions. Second operand 3 states. [2019-11-22 11:08:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:38,315 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2019-11-22 11:08:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:08:38,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 11:08:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:38,318 INFO L225 Difference]: With dead ends: 312 [2019-11-22 11:08:38,318 INFO L226 Difference]: Without dead ends: 312 [2019-11-22 11:08:38,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:08:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-22 11:08:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2019-11-22 11:08:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-22 11:08:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2019-11-22 11:08:38,329 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 33 [2019-11-22 11:08:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:38,330 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2019-11-22 11:08:38,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:08:38,330 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2019-11-22 11:08:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:08:38,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:38,332 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:38,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:38,537 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 11:08:38,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:38,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1562568681] [2019-11-22 11:08:38,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:39,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:08:39,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:39,389 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 11:08:39,390 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:08:39,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 11:08:39,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:39,528 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 11:08:39,529 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 11:08:39,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:39,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:39,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 11:08:39,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:39,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:39,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:39,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:39,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:39,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 11:08:40,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:40,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:40,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 11:08:40,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:40,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:40,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 11:08:40,332 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:40,343 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:08:40,343 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:40,349 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:08:40,349 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:40,355 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:08:40,355 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:40,514 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 11:08:40,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:40,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 11:08:40,516 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:40,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:40,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:08:40,584 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 11:08:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:08:40,783 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 11:08:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 11:08:40,888 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 11:08:41,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562568681] [2019-11-22 11:08:41,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:08:41,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 11:08:41,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352769935] [2019-11-22 11:08:41,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 11:08:41,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:08:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 11:08:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:08:41,139 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand 14 states. [2019-11-22 11:08:43,095 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 11:08:47,966 WARN L192 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 11:08:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:08:49,645 INFO L93 Difference]: Finished difference Result 396 states and 499 transitions. [2019-11-22 11:08:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:08:49,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 11:08:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:08:49,648 INFO L225 Difference]: With dead ends: 396 [2019-11-22 11:08:49,648 INFO L226 Difference]: Without dead ends: 390 [2019-11-22 11:08:49,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 11:08:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-22 11:08:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 353. [2019-11-22 11:08:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-22 11:08:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 462 transitions. [2019-11-22 11:08:49,661 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 462 transitions. Word has length 33 [2019-11-22 11:08:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:08:49,662 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 462 transitions. [2019-11-22 11:08:49,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 11:08:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 462 transitions. [2019-11-22 11:08:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 11:08:49,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:08:49,663 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:08:49,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:49,869 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err6ASSERT_VIOLATIONMEMORY_FREE, c2Err7ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err8ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 11:08:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:08:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1447512898, now seen corresponding path program 1 times [2019-11-22 11:08:49,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:08:49,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [8355969] [2019-11-22 11:08:49,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:08:50,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 11:08:50,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:08:50,754 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:08:50,754 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:08:50,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 11:08:50,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:50,906 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 11:08:50,907 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 11:08:50,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:08:50,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 11:08:50,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-22 11:08:50,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:50,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:50,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:08:50,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 11:08:51,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:08:51,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 11:08:51,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:08:51,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:08:51,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 11:08:51,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 11:08:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:08:51,122 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:08:51,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:51,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:08:51,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:08:52,312 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-22 11:08:52,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:08:52,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:08:52,519 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 11:08:52,530 INFO L168 Benchmark]: Toolchain (without parser) took 59020.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 393.2 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -216.1 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. [2019-11-22 11:08:52,530 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:08:52,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-22 11:08:52,531 INFO L168 Benchmark]: Boogie Preprocessor took 114.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-22 11:08:52,531 INFO L168 Benchmark]: RCFGBuilder took 841.25 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: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 11.5 GB. [2019-11-22 11:08:52,532 INFO L168 Benchmark]: TraceAbstraction took 57318.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -141.2 MB). Peak memory consumption was 115.2 MB. Max. memory is 11.5 GB. [2019-11-22 11:08:52,534 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.49 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 741.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.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 841.25 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: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57318.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -141.2 MB). Peak memory consumption was 115.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...