./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 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_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-3d056a1 [2019-11-22 13:54:32,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:54:32,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:54:32,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:54:32,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:54:32,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:54:32,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:54:32,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:54:32,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:54:32,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:54:32,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:54:32,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:54:32,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:54:32,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:54:32,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:54:32,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:54:32,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:54:32,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:54:32,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:54:32,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:54:32,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:54:32,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:54:32,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:54:32,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:54:32,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:54:32,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:54:32,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:54:32,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:54:32,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:54:32,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:54:32,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:54:32,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:54:32,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:54:32,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:54:32,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:54:32,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:54:32,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:54:32,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:54:32,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:54:32,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:54:32,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:54:33,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:54:33,014 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:54:33,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:54:33,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:54:33,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:54:33,016 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:54:33,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:54:33,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:54:33,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:54:33,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:54:33,018 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:54:33,018 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:54:33,018 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:54:33,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:54:33,019 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:54:33,019 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:54:33,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:54:33,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:54:33,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:54:33,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:54:33,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:54:33,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:54:33,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:54:33,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:54:33,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:54:33,022 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 13:54:33,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:54:33,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:54:33,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:54:33,361 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:54:33,362 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:54:33,362 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 13:54:33,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7eb833e/b640e27469c74fda860c793cf6d75488/FLAG0c5ae2e94 [2019-11-22 13:54:33,948 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:54:33,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 13:54:33,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7eb833e/b640e27469c74fda860c793cf6d75488/FLAG0c5ae2e94 [2019-11-22 13:54:34,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7eb833e/b640e27469c74fda860c793cf6d75488 [2019-11-22 13:54:34,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:54:34,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:54:34,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:54:34,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:54:34,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:54:34,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:34,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106fd192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34, skipping insertion in model container [2019-11-22 13:54:34,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:34,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:54:34,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:54:34,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:54:34,875 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:54:34,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:54:34,997 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:54:34,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34 WrapperNode [2019-11-22 13:54:34,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:54:34,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:54:34,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:54:34,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:54:35,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:35,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:35,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:35,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:35,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:35,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:35,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... [2019-11-22 13:54:35,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:54:35,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:54:35,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:54:35,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:54:35,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:54:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:54:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:54:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 13:54:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 13:54:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 13:54:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 13:54:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 13:54:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 13:54:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:54:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 13:54:35,159 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 13:54:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 13:54:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 13:54:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 13:54:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 13:54:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 13:54:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 13:54:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 13:54:35,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 13:54:35,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 13:54:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 13:54:35,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 13:54:35,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 13:54:35,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 13:54:35,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 13:54:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 13:54:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 13:54:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 13:54:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 13:54:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 13:54:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 13:54:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 13:54:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 13:54:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 13:54:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 13:54:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 13:54:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 13:54:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 13:54:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 13:54:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 13:54:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 13:54:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 13:54:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 13:54:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 13:54:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 13:54:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 13:54:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 13:54:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 13:54:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 13:54:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 13:54:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 13:54:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 13:54:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 13:54:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 13:54:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 13:54:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 13:54:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 13:54:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 13:54:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 13:54:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 13:54:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 13:54:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 13:54:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:54:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 13:54:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:54:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 13:54:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 13:54:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 13:54:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 13:54:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 13:54:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 13:54:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 13:54:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 13:54:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 13:54:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 13:54:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 13:54:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 13:54:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 13:54:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 13:54:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 13:54:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 13:54:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 13:54:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 13:54:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 13:54:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 13:54:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 13:54:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 13:54:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 13:54:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 13:54:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 13:54:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 13:54:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 13:54:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 13:54:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 13:54:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 13:54:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 13:54:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 13:54:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 13:54:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 13:54:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 13:54:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 13:54:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 13:54:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 13:54:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 13:54:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 13:54:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 13:54:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 13:54:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 13:54:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 13:54:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 13:54:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 13:54:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 13:54:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 13:54:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 13:54:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 13:54:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 13:54:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 13:54:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 13:54:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 13:54:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 13:54:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 13:54:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 13:54:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 13:54:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 13:54:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 13:54:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 13:54:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 13:54:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 13:54:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 13:54:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 13:54:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 13:54:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 13:54:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 13:54:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 13:54:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 13:54:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 13:54:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 13:54:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 13:54:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 13:54:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 13:54:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 13:54:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 13:54:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 13:54:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 13:54:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 13:54:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 13:54:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 13:54:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 13:54:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 13:54:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 13:54:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 13:54:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 13:54:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 13:54:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 13:54:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 13:54:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 13:54:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 13:54:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 13:54:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 13:54:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 13:54:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 13:54:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 13:54:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 13:54:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 13:54:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 13:54:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 13:54:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 13:54:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 13:54:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:54:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:54:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:54:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:54:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-22 13:54:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 13:54:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:54:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 13:54:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:54:35,847 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:54:35,847 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 13:54:35,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:54:35 BoogieIcfgContainer [2019-11-22 13:54:35,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:54:35,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:54:35,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:54:35,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:54:35,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:54:34" (1/3) ... [2019-11-22 13:54:35,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d34493e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:54:35, skipping insertion in model container [2019-11-22 13:54:35,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:34" (2/3) ... [2019-11-22 13:54:35,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d34493e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:54:35, skipping insertion in model container [2019-11-22 13:54:35,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:54:35" (3/3) ... [2019-11-22 13:54:35,858 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-22 13:54:35,867 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:54:35,875 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 13:54:35,885 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 13:54:35,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:54:35,902 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:54:35,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:54:35,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:54:35,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:54:35,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:54:35,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:54:35,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:54:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 13:54:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:54:35,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:35,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:35,934 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 13:54:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989328, now seen corresponding path program 1 times [2019-11-22 13:54:35,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:35,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177862075] [2019-11-22 13:54:35,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:36,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177862075] [2019-11-22 13:54:36,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:36,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 13:54:36,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379799053] [2019-11-22 13:54:36,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:54:36,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:54:36,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:54:36,433 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-22 13:54:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:36,995 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2019-11-22 13:54:36,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:54:36,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-22 13:54:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:37,009 INFO L225 Difference]: With dead ends: 97 [2019-11-22 13:54:37,010 INFO L226 Difference]: Without dead ends: 88 [2019-11-22 13:54:37,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:54:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-22 13:54:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-11-22 13:54:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-22 13:54:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2019-11-22 13:54:37,071 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 9 [2019-11-22 13:54:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:37,071 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2019-11-22 13:54:37,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:54:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2019-11-22 13:54:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:54:37,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:37,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:37,074 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 13:54:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989329, now seen corresponding path program 1 times [2019-11-22 13:54:37,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:37,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592357144] [2019-11-22 13:54:37,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:37,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592357144] [2019-11-22 13:54:37,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:37,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:54:37,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597199280] [2019-11-22 13:54:37,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:54:37,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:54:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:54:37,349 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand 6 states. [2019-11-22 13:54:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:38,152 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2019-11-22 13:54:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:54:38,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 13:54:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:38,158 INFO L225 Difference]: With dead ends: 165 [2019-11-22 13:54:38,158 INFO L226 Difference]: Without dead ends: 165 [2019-11-22 13:54:38,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:54:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-22 13:54:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2019-11-22 13:54:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-22 13:54:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 192 transitions. [2019-11-22 13:54:38,180 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 192 transitions. Word has length 9 [2019-11-22 13:54:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:38,180 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 192 transitions. [2019-11-22 13:54:38,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:54:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2019-11-22 13:54:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 13:54:38,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:38,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:38,181 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 13:54:38,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:38,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1859028932, now seen corresponding path program 1 times [2019-11-22 13:54:38,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:38,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475780027] [2019-11-22 13:54:38,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:38,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475780027] [2019-11-22 13:54:38,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:38,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:54:38,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217964861] [2019-11-22 13:54:38,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:54:38,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:38,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:54:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:54:38,556 INFO L87 Difference]: Start difference. First operand 134 states and 192 transitions. Second operand 6 states. [2019-11-22 13:54:38,802 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-22 13:54:38,950 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-22 13:54:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:39,685 INFO L93 Difference]: Finished difference Result 246 states and 348 transitions. [2019-11-22 13:54:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:54:39,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 13:54:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:39,689 INFO L225 Difference]: With dead ends: 246 [2019-11-22 13:54:39,690 INFO L226 Difference]: Without dead ends: 246 [2019-11-22 13:54:39,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:54:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-22 13:54:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 192. [2019-11-22 13:54:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 13:54:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 283 transitions. [2019-11-22 13:54:39,716 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 283 transitions. Word has length 10 [2019-11-22 13:54:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:39,717 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 283 transitions. [2019-11-22 13:54:39,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:54:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 283 transitions. [2019-11-22 13:54:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 13:54:39,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:39,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:39,719 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 13:54:39,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1795322128, now seen corresponding path program 1 times [2019-11-22 13:54:39,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:39,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292820121] [2019-11-22 13:54:39,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:40,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292820121] [2019-11-22 13:54:40,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:40,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:54:40,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580759847] [2019-11-22 13:54:40,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:54:40,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:54:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:54:40,002 INFO L87 Difference]: Start difference. First operand 192 states and 283 transitions. Second operand 6 states. [2019-11-22 13:54:40,252 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-22 13:54:40,455 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-11-22 13:54:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:41,140 INFO L93 Difference]: Finished difference Result 226 states and 305 transitions. [2019-11-22 13:54:41,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:54:41,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-22 13:54:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:41,144 INFO L225 Difference]: With dead ends: 226 [2019-11-22 13:54:41,144 INFO L226 Difference]: Without dead ends: 226 [2019-11-22 13:54:41,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:54:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-22 13:54:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-11-22 13:54:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 13:54:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2019-11-22 13:54:41,165 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 11 [2019-11-22 13:54:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:41,165 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2019-11-22 13:54:41,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:54:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2019-11-22 13:54:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 13:54:41,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:41,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:41,167 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 13:54:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash -179588794, now seen corresponding path program 1 times [2019-11-22 13:54:41,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:41,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936100391] [2019-11-22 13:54:41,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:41,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936100391] [2019-11-22 13:54:41,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:41,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:54:41,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753653437] [2019-11-22 13:54:41,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:54:41,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:54:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:54:41,364 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand 7 states. [2019-11-22 13:54:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:42,278 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2019-11-22 13:54:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:54:42,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-22 13:54:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:42,282 INFO L225 Difference]: With dead ends: 271 [2019-11-22 13:54:42,282 INFO L226 Difference]: Without dead ends: 271 [2019-11-22 13:54:42,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:54:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-22 13:54:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 223. [2019-11-22 13:54:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 13:54:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 325 transitions. [2019-11-22 13:54:42,301 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 325 transitions. Word has length 12 [2019-11-22 13:54:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:42,302 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 325 transitions. [2019-11-22 13:54:42,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:54:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 325 transitions. [2019-11-22 13:54:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 13:54:42,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:42,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:42,303 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 13:54:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:42,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1272285230, now seen corresponding path program 1 times [2019-11-22 13:54:42,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:42,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296552771] [2019-11-22 13:54:42,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:42,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296552771] [2019-11-22 13:54:42,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:54:42,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:54:42,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38423318] [2019-11-22 13:54:42,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:54:42,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:42,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:54:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:54:42,521 INFO L87 Difference]: Start difference. First operand 223 states and 325 transitions. Second operand 7 states. [2019-11-22 13:54:42,746 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-22 13:54:42,938 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-22 13:54:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:43,535 INFO L93 Difference]: Finished difference Result 255 states and 337 transitions. [2019-11-22 13:54:43,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:54:43,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-22 13:54:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:43,540 INFO L225 Difference]: With dead ends: 255 [2019-11-22 13:54:43,540 INFO L226 Difference]: Without dead ends: 255 [2019-11-22 13:54:43,541 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 13:54:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-22 13:54:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2019-11-22 13:54:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 13:54:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 323 transitions. [2019-11-22 13:54:43,556 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 323 transitions. Word has length 13 [2019-11-22 13:54:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:43,557 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 323 transitions. [2019-11-22 13:54:43,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:54:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 323 transitions. [2019-11-22 13:54:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 13:54:43,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:43,558 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:43,558 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 13:54:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash 668439832, now seen corresponding path program 1 times [2019-11-22 13:54:43,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:43,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690130045] [2019-11-22 13:54:43,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:43,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690130045] [2019-11-22 13:54:43,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806423854] [2019-11-22 13:54:43,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:43,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:54:43,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:54:44,184 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 13:54:44,185 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 13:54:44,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:54:44,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:44,253 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 13:54:44,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:54:44,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 13:54:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:44,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:54:44,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-11-22 13:54:44,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596790723] [2019-11-22 13:54:44,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:54:44,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:54:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:54:44,310 INFO L87 Difference]: Start difference. First operand 223 states and 323 transitions. Second operand 10 states. [2019-11-22 13:54:44,742 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-22 13:54:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:45,282 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2019-11-22 13:54:45,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:54:45,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 13:54:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:45,285 INFO L225 Difference]: With dead ends: 257 [2019-11-22 13:54:45,285 INFO L226 Difference]: Without dead ends: 257 [2019-11-22 13:54:45,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-22 13:54:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-22 13:54:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 227. [2019-11-22 13:54:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-22 13:54:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2019-11-22 13:54:45,317 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 17 [2019-11-22 13:54:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:45,318 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2019-11-22 13:54:45,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:54:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2019-11-22 13:54:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:54:45,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:45,322 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:45,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:45,526 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 13:54:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -753201699, now seen corresponding path program 1 times [2019-11-22 13:54:45,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:45,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799372893] [2019-11-22 13:54:45,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:45,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799372893] [2019-11-22 13:54:45,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038807371] [2019-11-22 13:54:45,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:46,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-22 13:54:46,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:54:46,313 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-22 13:54:46,314 INFO L343 Elim1Store]: treesize reduction 487, result has 22.1 percent of original size [2019-11-22 13:54:46,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 324 treesize of output 420 [2019-11-22 13:54:46,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:54:46,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:46,979 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 61 [2019-11-22 13:54:46,980 INFO L567 ElimStorePlain]: treesize reduction 12278, result has 1.1 percent of original size [2019-11-22 13:54:46,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:46,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:54:46,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:120, output treesize:134 [2019-11-22 13:54:46,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:47,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:47,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:47,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:47,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:47,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:54:50,098 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-22 13:54:51,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:54:51,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2019-11-22 13:54:51,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:51,231 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 13:54:51,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:51,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 77 [2019-11-22 13:54:51,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:51,377 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 13:54:51,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:51,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2019-11-22 13:54:51,398 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:54:51,529 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-22 13:54:51,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:54:51,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 3 xjuncts. [2019-11-22 13:54:51,533 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:307, output treesize:222 [2019-11-22 13:54:53,784 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-22 13:54:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:53,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:54:53,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2019-11-22 13:54:53,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447114261] [2019-11-22 13:54:53,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-22 13:54:53,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:54:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-22 13:54:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-22 13:54:53,798 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand 15 states. [2019-11-22 13:54:54,171 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-22 13:54:54,957 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 178 [2019-11-22 13:54:55,229 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-22 13:54:57,457 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 229 DAG size of output: 178 [2019-11-22 13:54:57,837 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-22 13:54:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:54:59,285 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2019-11-22 13:54:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 13:54:59,286 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-22 13:54:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:54:59,288 INFO L225 Difference]: With dead ends: 278 [2019-11-22 13:54:59,288 INFO L226 Difference]: Without dead ends: 278 [2019-11-22 13:54:59,288 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 13:54:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-22 13:54:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 233. [2019-11-22 13:54:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-22 13:54:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 326 transitions. [2019-11-22 13:54:59,299 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 326 transitions. Word has length 18 [2019-11-22 13:54:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:54:59,300 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 326 transitions. [2019-11-22 13:54:59,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-22 13:54:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 326 transitions. [2019-11-22 13:54:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 13:54:59,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:54:59,301 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:54:59,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:54:59,504 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 13:54:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:54:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1874416105, now seen corresponding path program 1 times [2019-11-22 13:54:59,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:54:59,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668889042] [2019-11-22 13:54:59,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:54:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:54:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:54:59,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668889042] [2019-11-22 13:54:59,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782607620] [2019-11-22 13:54:59,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:55:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:00,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:55:00,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:00,134 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 23=[|v_#valid_49|]} [2019-11-22 13:55:00,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,180 INFO L343 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2019-11-22 13:55:00,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2019-11-22 13:55:00,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:00,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:00,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:00,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:00,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 223 [2019-11-22 13:55:00,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:00,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:00,551 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-22 13:55:00,552 INFO L567 ElimStorePlain]: treesize reduction 1486, result has 6.2 percent of original size [2019-11-22 13:55:00,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 13:55:00,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:135, output treesize:99 [2019-11-22 13:55:00,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2019-11-22 13:55:00,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:00,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:00,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 13:55:00,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:00,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:00,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:55:00,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:66 [2019-11-22 13:55:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:00,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:55:00,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-11-22 13:55:00,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164744444] [2019-11-22 13:55:00,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 13:55:00,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:00,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 13:55:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-22 13:55:00,924 INFO L87 Difference]: Start difference. First operand 233 states and 326 transitions. Second operand 14 states. [2019-11-22 13:55:01,098 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 13:55:01,349 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-11-22 13:55:01,641 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 13:55:01,973 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-22 13:55:02,557 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-11-22 13:55:02,938 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-22 13:55:03,427 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-22 13:55:03,856 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-22 13:55:04,214 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-11-22 13:55:04,548 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-11-22 13:55:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:05,293 INFO L93 Difference]: Finished difference Result 266 states and 355 transitions. [2019-11-22 13:55:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 13:55:05,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-22 13:55:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:05,300 INFO L225 Difference]: With dead ends: 266 [2019-11-22 13:55:05,301 INFO L226 Difference]: Without dead ends: 266 [2019-11-22 13:55:05,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-11-22 13:55:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-22 13:55:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2019-11-22 13:55:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-22 13:55:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 323 transitions. [2019-11-22 13:55:05,321 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 323 transitions. Word has length 19 [2019-11-22 13:55:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:05,321 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 323 transitions. [2019-11-22 13:55:05,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 13:55:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 323 transitions. [2019-11-22 13:55:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 13:55:05,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:05,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:05,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:55:05,527 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 13:55:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash 550415913, now seen corresponding path program 1 times [2019-11-22 13:55:05,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:05,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185791348] [2019-11-22 13:55:05,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:05,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185791348] [2019-11-22 13:55:05,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:05,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 13:55:05,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229079717] [2019-11-22 13:55:05,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:05,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:05,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:05,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:05,644 INFO L87 Difference]: Start difference. First operand 233 states and 323 transitions. Second operand 4 states. [2019-11-22 13:55:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:05,996 INFO L93 Difference]: Finished difference Result 331 states and 471 transitions. [2019-11-22 13:55:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:55:05,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-22 13:55:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:06,000 INFO L225 Difference]: With dead ends: 331 [2019-11-22 13:55:06,001 INFO L226 Difference]: Without dead ends: 331 [2019-11-22 13:55:06,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:55:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-22 13:55:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 312. [2019-11-22 13:55:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-22 13:55:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 461 transitions. [2019-11-22 13:55:06,015 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 461 transitions. Word has length 23 [2019-11-22 13:55:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:06,015 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 461 transitions. [2019-11-22 13:55:06,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 461 transitions. [2019-11-22 13:55:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 13:55:06,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:06,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:06,017 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 13:55:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash 550416137, now seen corresponding path program 1 times [2019-11-22 13:55:06,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:06,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214133412] [2019-11-22 13:55:06,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:06,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214133412] [2019-11-22 13:55:06,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:06,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 13:55:06,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967521971] [2019-11-22 13:55:06,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:06,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:06,109 INFO L87 Difference]: Start difference. First operand 312 states and 461 transitions. Second operand 4 states. [2019-11-22 13:55:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:06,348 INFO L93 Difference]: Finished difference Result 311 states and 458 transitions. [2019-11-22 13:55:06,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:55:06,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-22 13:55:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:06,355 INFO L225 Difference]: With dead ends: 311 [2019-11-22 13:55:06,356 INFO L226 Difference]: Without dead ends: 311 [2019-11-22 13:55:06,356 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 13:55:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-22 13:55:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-11-22 13:55:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-22 13:55:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 458 transitions. [2019-11-22 13:55:06,370 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 458 transitions. Word has length 23 [2019-11-22 13:55:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:06,370 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 458 transitions. [2019-11-22 13:55:06,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 458 transitions. [2019-11-22 13:55:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 13:55:06,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:06,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:06,372 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 13:55:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash -116975829, now seen corresponding path program 1 times [2019-11-22 13:55:06,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:06,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29511182] [2019-11-22 13:55:06,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:06,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29511182] [2019-11-22 13:55:06,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:06,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 13:55:06,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671079649] [2019-11-22 13:55:06,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:06,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:06,482 INFO L87 Difference]: Start difference. First operand 311 states and 458 transitions. Second operand 4 states. [2019-11-22 13:55:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:06,901 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2019-11-22 13:55:06,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:55:06,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 13:55:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:06,903 INFO L225 Difference]: With dead ends: 381 [2019-11-22 13:55:06,904 INFO L226 Difference]: Without dead ends: 381 [2019-11-22 13:55:06,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:55:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-22 13:55:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 360. [2019-11-22 13:55:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-22 13:55:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 526 transitions. [2019-11-22 13:55:06,917 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 526 transitions. Word has length 24 [2019-11-22 13:55:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:06,919 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 526 transitions. [2019-11-22 13:55:06,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 526 transitions. [2019-11-22 13:55:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 13:55:06,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:06,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:06,924 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 13:55:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -116968878, now seen corresponding path program 1 times [2019-11-22 13:55:06,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:06,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394863167] [2019-11-22 13:55:06,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:06,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394863167] [2019-11-22 13:55:06,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:06,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 13:55:06,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481274610] [2019-11-22 13:55:06,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:55:06,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:06,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:55:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:55:06,996 INFO L87 Difference]: Start difference. First operand 360 states and 526 transitions. Second operand 4 states. [2019-11-22 13:55:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:07,278 INFO L93 Difference]: Finished difference Result 335 states and 491 transitions. [2019-11-22 13:55:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:55:07,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 13:55:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:07,282 INFO L225 Difference]: With dead ends: 335 [2019-11-22 13:55:07,282 INFO L226 Difference]: Without dead ends: 335 [2019-11-22 13:55:07,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:55:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-22 13:55:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2019-11-22 13:55:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-22 13:55:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 489 transitions. [2019-11-22 13:55:07,296 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 489 transitions. Word has length 24 [2019-11-22 13:55:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:07,297 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 489 transitions. [2019-11-22 13:55:07,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:55:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 489 transitions. [2019-11-22 13:55:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 13:55:07,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:07,298 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:07,299 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 13:55:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash 35178027, now seen corresponding path program 1 times [2019-11-22 13:55:07,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:07,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960106871] [2019-11-22 13:55:07,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:07,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960106871] [2019-11-22 13:55:07,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:07,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:55:07,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151369423] [2019-11-22 13:55:07,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:55:07,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:55:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:55:07,420 INFO L87 Difference]: Start difference. First operand 333 states and 489 transitions. Second operand 5 states. [2019-11-22 13:55:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:07,613 INFO L93 Difference]: Finished difference Result 242 states and 337 transitions. [2019-11-22 13:55:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:55:07,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-22 13:55:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:07,615 INFO L225 Difference]: With dead ends: 242 [2019-11-22 13:55:07,615 INFO L226 Difference]: Without dead ends: 242 [2019-11-22 13:55:07,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:55:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-22 13:55:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 233. [2019-11-22 13:55:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-22 13:55:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2019-11-22 13:55:07,624 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 33 [2019-11-22 13:55:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:07,625 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2019-11-22 13:55:07,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:55:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2019-11-22 13:55:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 13:55:07,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:07,626 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:07,627 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 13:55:07,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:07,627 INFO L82 PathProgramCache]: Analyzing trace with hash -138461554, now seen corresponding path program 1 times [2019-11-22 13:55:07,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:07,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102708071] [2019-11-22 13:55:07,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:55:07,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102708071] [2019-11-22 13:55:07,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092913738] [2019-11-22 13:55:07,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:55:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:07,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-22 13:55:07,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:08,147 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2019-11-22 13:55:08,147 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 13:55:08,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 202 treesize of output 258 [2019-11-22 13:55:08,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:08,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:08,391 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-11-22 13:55:08,392 INFO L567 ElimStorePlain]: treesize reduction 1301, result has 6.8 percent of original size [2019-11-22 13:55:08,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:08,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:55:08,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:95 [2019-11-22 13:55:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:08,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:08,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:09,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:09,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:09,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:55:09,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:09,633 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:09,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:09,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:09,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:55:09,686 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:09,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:09,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:55:09,741 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:09,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:09,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:09,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:09,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:09,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:09,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 121 [2019-11-22 13:55:09,834 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:09,884 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:09,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:55:09,886 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:09,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:09,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 102 [2019-11-22 13:55:09,919 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:10,197 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-22 13:55:10,198 INFO L567 ElimStorePlain]: treesize reduction 52, result has 81.0 percent of original size [2019-11-22 13:55:10,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 13:55:10,200 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:527, output treesize:12 [2019-11-22 13:55:10,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:10,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:55:10,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:55:10,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 13:55:10,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471614832] [2019-11-22 13:55:10,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:55:10,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:10,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:55:10,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:55:10,865 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand 12 states. [2019-11-22 13:55:12,406 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-11-22 13:55:13,450 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 13:55:40,777 WARN L192 SmtUtils]: Spent 27.23 s on a formula simplification. DAG size of input: 167 DAG size of output: 109 [2019-11-22 13:55:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:47,517 INFO L93 Difference]: Finished difference Result 323 states and 423 transitions. [2019-11-22 13:55:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:55:47,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-22 13:55:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:47,521 INFO L225 Difference]: With dead ends: 323 [2019-11-22 13:55:47,521 INFO L226 Difference]: Without dead ends: 321 [2019-11-22 13:55:47,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:55:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-22 13:55:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2019-11-22 13:55:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-22 13:55:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 380 transitions. [2019-11-22 13:55:47,530 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 380 transitions. Word has length 33 [2019-11-22 13:55:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:47,531 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 380 transitions. [2019-11-22 13:55:47,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:55:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 380 transitions. [2019-11-22 13:55:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 13:55:47,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:47,532 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:47,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:55:47,736 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 13:55:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1145602458, now seen corresponding path program 1 times [2019-11-22 13:55:47,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:47,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192991370] [2019-11-22 13:55:47,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:47,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192991370] [2019-11-22 13:55:47,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:55:47,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:55:47,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314701080] [2019-11-22 13:55:47,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:55:47,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:55:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:55:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:55:47,944 INFO L87 Difference]: Start difference. First operand 273 states and 380 transitions. Second operand 7 states. [2019-11-22 13:55:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:55:48,567 INFO L93 Difference]: Finished difference Result 304 states and 411 transitions. [2019-11-22 13:55:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:55:48,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-22 13:55:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:55:48,570 INFO L225 Difference]: With dead ends: 304 [2019-11-22 13:55:48,570 INFO L226 Difference]: Without dead ends: 304 [2019-11-22 13:55:48,570 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 13:55:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-22 13:55:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-11-22 13:55:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-22 13:55:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 409 transitions. [2019-11-22 13:55:48,579 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 409 transitions. Word has length 35 [2019-11-22 13:55:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:55:48,580 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 409 transitions. [2019-11-22 13:55:48,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:55:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 409 transitions. [2019-11-22 13:55:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 13:55:48,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:55:48,581 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:55:48,582 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 13:55:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:55:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1732408472, now seen corresponding path program 1 times [2019-11-22 13:55:48,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:55:48,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773857171] [2019-11-22 13:55:48,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:55:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:55:48,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773857171] [2019-11-22 13:55:48,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274292748] [2019-11-22 13:55:48,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:55:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:55:49,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-22 13:55:49,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:55:49,256 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 13:55:49,257 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 13:55:49,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:55:49,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:49,413 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-22 13:55:49,414 INFO L567 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-22 13:55:49,603 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 13:55:49,604 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 13:55:49,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 13:55:49,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:49,747 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-22 13:55:49,748 INFO L567 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-22 13:55:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:55:49,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-22 13:55:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:49,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:49,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:49,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:49,867 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:50,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:50,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:50,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,072 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:50,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:50,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:50,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,350 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:50,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 13:55:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:50,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:50,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:50,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:50,697 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:50,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:50,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-22 13:55:50,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:50,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:50,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 130 [2019-11-22 13:55:50,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:50,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:50,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2019-11-22 13:55:50,980 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 98 [2019-11-22 13:55:51,048 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,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, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 135 [2019-11-22 13:55:51,150 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-11-22 13:55:51,171 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:51,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 13:55:51,213 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,230 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,231 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,248 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,248 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 95 [2019-11-22 13:55:51,313 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,330 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,330 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,345 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,345 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,360 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,360 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:51,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 13:55:51,403 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,424 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:51,426 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-11-22 13:55:51,428 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,447 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,448 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:51,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 13:55:51,473 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:51,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 13:55:51,535 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,575 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:51,576 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,593 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,593 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,610 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,610 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,626 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,627 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,651 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,652 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:51,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 13:55:51,710 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,733 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,733 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,751 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,751 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,773 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,773 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 95 [2019-11-22 13:55:51,836 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,854 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,854 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:51,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:51,902 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,918 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:51,919 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:51,958 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:51,973 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:51,975 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 95 [2019-11-22 13:55:52,010 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 13:55:52,046 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:52,099 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,118 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,119 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,137 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,137 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,166 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,167 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:52,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:52,231 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,259 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,260 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,287 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,288 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 65 treesize of output 103 [2019-11-22 13:55:52,375 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,397 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,398 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,419 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:52,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 13:55:52,425 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,458 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:52,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,526 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,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, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 130 [2019-11-22 13:55:52,526 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,547 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,547 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2019-11-22 13:55:52,590 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,613 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 71 [2019-11-22 13:55:52,636 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:52,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,683 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:52,684 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,704 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,704 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,721 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,722 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,738 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,739 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:52,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-11-22 13:55:52,800 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 13:55:52,833 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,853 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,854 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,875 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,875 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:52,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2019-11-22 13:55:52,904 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,921 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,921 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,939 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:52,940 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:52,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:52,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:52,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,038 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 130 [2019-11-22 13:55:53,039 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,056 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,056 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 13:55:53,080 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 71 [2019-11-22 13:55:53,126 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:53,168 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,192 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,192 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,209 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,209 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 13:55:53,253 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:53,286 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,304 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,305 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,321 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,321 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,339 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,339 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,367 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2019-11-22 13:55:53,396 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,412 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,413 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 76 [2019-11-22 13:55:53,463 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,480 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,480 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,497 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,497 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,518 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,518 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,534 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,534 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2019-11-22 13:55:53,571 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 13:55:53,617 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,637 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:53,650 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 13:55:53,674 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,689 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,690 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,713 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,714 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,723 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2019-11-22 13:55:53,737 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-22 13:55:53,763 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:53,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-11-22 13:55:53,784 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,800 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,800 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 13:55:53,821 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,838 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,838 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 57 [2019-11-22 13:55:53,869 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,885 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,885 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,902 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:53,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:53,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:53,913 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,930 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,930 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,945 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,945 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,962 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,978 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:53,994 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:53,995 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,009 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,010 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,025 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,025 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,041 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,041 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2019-11-22 13:55:54,070 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,093 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,093 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,113 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,113 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,135 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,136 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,176 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:54,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2019-11-22 13:55:54,182 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,204 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,204 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,225 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,226 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,242 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,242 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,256 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,256 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,271 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,271 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,292 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,294 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:54,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 62 [2019-11-22 13:55:54,300 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,316 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,316 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,331 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,331 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,347 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,347 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 13:55:54,364 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,380 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,380 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,395 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,395 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,409 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,409 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,423 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,423 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,436 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,436 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,449 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,450 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,463 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,463 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-11-22 13:55:54,480 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,495 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,496 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-11-22 13:55:54,512 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,525 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,525 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,538 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,538 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,551 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,552 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,596 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,596 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,604 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,604 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,612 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,612 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,622 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,623 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,631 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,632 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,638 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,639 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,647 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,647 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,657 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,657 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,664 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,665 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,673 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,673 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,682 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,682 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,690 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,690 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,698 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,699 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,707 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,708 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,715 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,715 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,722 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,722 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,735 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,736 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,744 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,744 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,752 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,752 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,759 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,760 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,767 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,767 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,774 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,775 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,781 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:55:54,782 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,925 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-11-22 13:55:54,926 INFO L567 ElimStorePlain]: treesize reduction 812, result has 4.8 percent of original size [2019-11-22 13:55:54,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:54,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2019-11-22 13:55:54,937 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,940 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:54,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2019-11-22 13:55:54,942 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,960 INFO L567 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-22 13:55:54,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:55:54,961 INFO L221 ElimStorePlain]: Needed 153 recursive calls to eliminate 7 variables, input treesize:7491, output treesize:10 [2019-11-22 13:55:55,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:55:55,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:55,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:55,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 13:55:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:55:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 13:55:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:55:55,024 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 13:55:55,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:55,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:55,306 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:55,394 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:55,395 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,569 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:55:55,571 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:55,613 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:55,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:55,705 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:55,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 13:55:55,748 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:55,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:55:55,808 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:55,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:55:55,872 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:55,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:55,910 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:55,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:55,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,039 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:56,041 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:56,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 13:55:56,084 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:56,169 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:56,292 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:56,352 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:56,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:56,440 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:56,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:56,528 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:56,585 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:56,708 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:56,800 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:56,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:56,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 13:55:56,927 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:56,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:56,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:57,011 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:57,134 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 144 [2019-11-22 13:55:57,255 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:57,309 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 13:55:57,483 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:57,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:55:57,545 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:57,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:57,641 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:57,773 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:57,867 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:57,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:55:57,925 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:57,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:57,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:58,011 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:55:58,195 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:58,285 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:55:58,351 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:55:58,440 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,511 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:58,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 13:55:58,568 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:58,610 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 13:55:58,649 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:55:58,735 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,871 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:58,873 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:58,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2019-11-22 13:55:58,933 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:58,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:58,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,015 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:59,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:59,054 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:59,179 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:55:59,292 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:55:59,460 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:55:59,512 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:55:59,569 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,693 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:59,694 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:55:59,785 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:55:59,912 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 13:55:59,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:55:59,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:55:59,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:55:59,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:55:59,998 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:56:00,087 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:00,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 13:56:00,131 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:00,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:56:00,221 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:56:00,305 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:00,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:56:00,372 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:56:00,455 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:56:00,544 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 144 [2019-11-22 13:56:00,666 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:56:00,750 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:56:00,838 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:00,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:00,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:00,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:56:00,983 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:56:01,103 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 13:56:01,226 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,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, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 13:56:01,398 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:56:01,453 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:56:01,535 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,572 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:01,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:56:01,591 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:56:01,645 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,694 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:01,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:56:01,733 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 13:56:01,792 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:56:01,913 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:01,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:01,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:01,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:56:01,973 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:01,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 75 treesize of output 189 [2019-11-22 13:56:02,145 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:56:02,233 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,298 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:02,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 73 treesize of output 144 [2019-11-22 13:56:02,356 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:02,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 13:56:02,399 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,431 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:02,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 13:56:02,442 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:02,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:56:02,502 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,552 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:02,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,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, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 13:56:02,591 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 69 [2019-11-22 13:56:02,649 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 192 [2019-11-22 13:56:02,830 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:02,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:02,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:56:02,895 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:02,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:02,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 13:56:03,018 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2019-11-22 13:56:03,057 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:56:03,148 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,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, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:56:03,240 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 13:56:03,331 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,367 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 13:56:03,391 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 13:56:03,475 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,504 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 13:56:03,504 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,531 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:56:03,550 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,573 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-22 13:56:03,578 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 13:56:03,666 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,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 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 72 [2019-11-22 13:56:03,730 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,813 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 13:56:03,814 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2019-11-22 13:56:03,859 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,914 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:03,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 13:56:03,952 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:03,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:03,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:03,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,062 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:56:04,064 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:56:04,101 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:56:04,138 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:56:04,193 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,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, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:56:04,229 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,261 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:56:04,282 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,298 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 13:56:04,301 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:56:04,332 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,351 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,366 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:56:04,367 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 144 [2019-11-22 13:56:04,489 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,518 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,535 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,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, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 13:56:04,575 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,597 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:56:04,628 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,708 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 80 treesize of output 192 [2019-11-22 13:56:04,804 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:56:04,857 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,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, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:56:04,940 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:04,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:04,965 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,978 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:04,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:04,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 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:56:05,000 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:56:05,059 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:56:05,092 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 141 [2019-11-22 13:56:05,220 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,274 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:56:05,275 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:56:05,336 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,351 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,352 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,353 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-11-22 13:56:05,354 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 13:56:05,412 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:56:05,454 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-22 13:56:05,472 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,505 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:56:05,506 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,522 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 13:56:05,529 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,562 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:56:05,581 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 13:56:05,645 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:56:05,679 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,701 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,713 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,713 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 13:56:05,730 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:56:05,784 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,824 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 13:56:05,844 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:05,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 144 [2019-11-22 13:56:05,970 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:05,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,986 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:05,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:05,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 72 [2019-11-22 13:56:06,026 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,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, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2019-11-22 13:56:06,061 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,081 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:56:06,102 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-22 13:56:06,124 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,159 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:56:06,160 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2019-11-22 13:56:06,244 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:56:06,281 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:56:06,363 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 144 [2019-11-22 13:56:06,480 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,511 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,530 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,531 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 104 [2019-11-22 13:56:06,563 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,584 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-11-22 13:56:06,601 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2019-11-22 13:56:06,633 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:56:06,691 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,739 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,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, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 13:56:06,781 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,813 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:56:06,866 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 13:56:06,904 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,927 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:06,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:06,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:06,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 101 [2019-11-22 13:56:06,983 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:06,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:07,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,021 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:07,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:07,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 104 [2019-11-22 13:56:07,065 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:07,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:07,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:07,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:07,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 13:56:07,106 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:07,523 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 16 [2019-11-22 13:56:07,524 INFO L567 ElimStorePlain]: treesize reduction 3780, result has 0.5 percent of original size [2019-11-22 13:56:07,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-22 13:56:07,528 INFO L496 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:07,540 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-22 13:56:07,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 13:56:07,541 INFO L221 ElimStorePlain]: Needed 154 recursive calls to eliminate 8 variables, input treesize:8439, output treesize:14 [2019-11-22 13:56:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:07,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:56:07,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2019-11-22 13:56:07,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032023068] [2019-11-22 13:56:07,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 13:56:07,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:56:07,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 13:56:07,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-22 13:56:07,622 INFO L87 Difference]: Start difference. First operand 297 states and 409 transitions. Second operand 19 states. [2019-11-22 13:56:08,251 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-22 13:56:18,263 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-22 13:56:19,108 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-22 13:56:20,778 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-22 13:56:20,991 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-11-22 13:56:21,126 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-11-22 13:56:31,220 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-22 13:56:31,832 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-22 13:56:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:43,277 INFO L93 Difference]: Finished difference Result 531 states and 667 transitions. [2019-11-22 13:56:43,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-22 13:56:43,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-22 13:56:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:43,282 INFO L225 Difference]: With dead ends: 531 [2019-11-22 13:56:43,282 INFO L226 Difference]: Without dead ends: 531 [2019-11-22 13:56:43,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=681, Invalid=1971, Unknown=0, NotChecked=0, Total=2652 [2019-11-22 13:56:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-22 13:56:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 448. [2019-11-22 13:56:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-22 13:56:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 599 transitions. [2019-11-22 13:56:43,298 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 599 transitions. Word has length 35 [2019-11-22 13:56:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:43,299 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 599 transitions. [2019-11-22 13:56:43,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 13:56:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 599 transitions. [2019-11-22 13:56:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 13:56:43,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:43,300 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:43,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:43,501 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 13:56:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:43,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2659210, now seen corresponding path program 1 times [2019-11-22 13:56:43,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:56:43,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443226338] [2019-11-22 13:56:43,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:56:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:56:43,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443226338] [2019-11-22 13:56:43,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690502420] [2019-11-22 13:56:43,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:43,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 13:56:43,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:43,931 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 5=[|v_#valid_53|]} [2019-11-22 13:56:43,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:43,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:43,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:43,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:44,099 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-22 13:56:44,100 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-22 13:56:44,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:56:44,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:44,184 INFO L567 ElimStorePlain]: treesize reduction 50, result has 59.7 percent of original size [2019-11-22 13:56:44,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-11-22 13:56:44,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-22 13:56:44,313 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-22 13:56:44,313 INFO L567 ElimStorePlain]: treesize reduction 26, result has 72.9 percent of original size [2019-11-22 13:56:44,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:56:44,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:70 [2019-11-22 13:56:44,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:44,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 13:56:45,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:56:45,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,324 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:56:45,326 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 13:56:45,362 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,412 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:56:45,413 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 86 [2019-11-22 13:56:45,465 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,496 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-22 13:56:45,497 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 13:56:45,512 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,517 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:56:45,517 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,531 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-22 13:56:45,539 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,548 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-22 13:56:45,560 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 13:56:45,578 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,594 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:45,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-22 13:56:45,595 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:56:45,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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 13:56:45,605 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-11-22 13:56:45,613 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,619 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:56:45,619 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,623 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:56:45,623 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,677 INFO L567 ElimStorePlain]: treesize reduction 267, result has 4.0 percent of original size [2019-11-22 13:56:45,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:45,678 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:669, output treesize:7 [2019-11-22 13:56:45,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:45,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:48,096 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-11-22 13:56:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-22 13:56:48,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:56:48,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2019-11-22 13:56:48,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565302792] [2019-11-22 13:56:48,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 13:56:48,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:56:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 13:56:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:56:48,151 INFO L87 Difference]: Start difference. First operand 448 states and 599 transitions. Second operand 13 states. [2019-11-22 13:56:48,399 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-22 13:56:49,092 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-22 13:56:49,500 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-11-22 13:56:51,846 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-11-22 13:56:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:51,894 INFO L93 Difference]: Finished difference Result 468 states and 606 transitions. [2019-11-22 13:56:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:56:51,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-22 13:56:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:51,898 INFO L225 Difference]: With dead ends: 468 [2019-11-22 13:56:51,898 INFO L226 Difference]: Without dead ends: 468 [2019-11-22 13:56:51,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-11-22 13:56:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-22 13:56:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 451. [2019-11-22 13:56:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-22 13:56:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 595 transitions. [2019-11-22 13:56:51,913 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 595 transitions. Word has length 34 [2019-11-22 13:56:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:51,913 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 595 transitions. [2019-11-22 13:56:51,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 13:56:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 595 transitions. [2019-11-22 13:56:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 13:56:51,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:51,915 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 13:56:52,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:52,125 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 13:56:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1389741599, now seen corresponding path program 1 times [2019-11-22 13:56:52,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:56:52,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740871496] [2019-11-22 13:56:52,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:56:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:52,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740871496] [2019-11-22 13:56:52,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410580381] [2019-11-22 13:56:52,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:52,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:56:52,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:52,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:56:52,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 18 [2019-11-22 13:56:52,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783318786] [2019-11-22 13:56:52,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:56:52,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:56:52,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:56:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-22 13:56:52,639 INFO L87 Difference]: Start difference. First operand 451 states and 595 transitions. Second operand 6 states. [2019-11-22 13:56:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:52,773 INFO L93 Difference]: Finished difference Result 475 states and 617 transitions. [2019-11-22 13:56:52,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:56:52,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-22 13:56:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:52,776 INFO L225 Difference]: With dead ends: 475 [2019-11-22 13:56:52,776 INFO L226 Difference]: Without dead ends: 475 [2019-11-22 13:56:52,777 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 13:56:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-22 13:56:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 456. [2019-11-22 13:56:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-22 13:56:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-11-22 13:56:52,791 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 36 [2019-11-22 13:56:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:52,791 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-11-22 13:56:52,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:56:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-11-22 13:56:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 13:56:52,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:52,792 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:52,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:52,996 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 13:56:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1602768999, now seen corresponding path program 1 times [2019-11-22 13:56:52,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:56:52,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340581279] [2019-11-22 13:56:52,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:56:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:53,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340581279] [2019-11-22 13:56:53,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220743373] [2019-11-22 13:56:53,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:53,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:56:53,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:54,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 13:56:54,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:54,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:54,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 13:56:54,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:54,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:54,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:54,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-22 13:56:54,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:54,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-22 13:56:54,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:54,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:54,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-22 13:56:54,300 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:54,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:54,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 13:56:54,310 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-22 13:56:54,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-22 13:56:54,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:54,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:54,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 13:56:54,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:54,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:54,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 13:56:54,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-22 13:56:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:54,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:56:54,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 26 [2019-11-22 13:56:54,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333474301] [2019-11-22 13:56:54,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 13:56:54,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:56:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 13:56:54,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-11-22 13:56:54,457 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 27 states. [2019-11-22 13:56:54,751 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-22 13:56:54,955 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-11-22 13:56:55,894 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-22 13:56:56,111 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-11-22 13:56:57,230 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-22 13:56:57,459 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-22 13:56:57,610 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-22 13:56:57,804 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-11-22 13:56:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:58,163 INFO L93 Difference]: Finished difference Result 504 states and 634 transitions. [2019-11-22 13:56:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-22 13:56:58,164 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-11-22 13:56:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:58,167 INFO L225 Difference]: With dead ends: 504 [2019-11-22 13:56:58,167 INFO L226 Difference]: Without dead ends: 504 [2019-11-22 13:56:58,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=539, Invalid=1717, Unknown=0, NotChecked=0, Total=2256 [2019-11-22 13:56:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-22 13:56:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 457. [2019-11-22 13:56:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-22 13:56:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 593 transitions. [2019-11-22 13:56:58,185 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 593 transitions. Word has length 37 [2019-11-22 13:56:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:58,186 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 593 transitions. [2019-11-22 13:56:58,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 13:56:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 593 transitions. [2019-11-22 13:56:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-22 13:56:58,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:58,188 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 13:56:58,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:58,392 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 13:56:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash 304472762, now seen corresponding path program 1 times [2019-11-22 13:56:58,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:56:58,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598900158] [2019-11-22 13:56:58,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:56:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:58,639 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 13:56:58,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598900158] [2019-11-22 13:56:58,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085161449] [2019-11-22 13:56:58,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:56:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:58,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-22 13:56:58,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:58,972 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 27 [2019-11-22 13:56:58,973 INFO L343 Elim1Store]: treesize reduction 340, result has 12.1 percent of original size [2019-11-22 13:56:58,973 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 13:56:58,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:59,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:56:59,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:56:59,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:32, output treesize:59 [2019-11-22 13:56:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:56:59,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:56:59,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:56:59,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:57:00,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:57:00,203 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-22 13:57:00,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:00,204 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 13:57:00,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:00,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:00,316 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 13:57:00,317 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:00,320 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:00,321 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:00,325 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:00,325 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:00,329 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:00,329 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:00,332 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:00,332 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:00,351 INFO L567 ElimStorePlain]: treesize reduction 32, result has 25.6 percent of original size [2019-11-22 13:57:00,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:00,352 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:252, output treesize:11 [2019-11-22 13:57:00,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 13:57:00,666 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 13:57:00,667 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 13:57:00,667 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 13:57:00,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:01,043 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 81 [2019-11-22 13:57:01,044 INFO L343 Elim1Store]: treesize reduction 80, result has 68.8 percent of original size [2019-11-22 13:57:01,044 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 13:57:01,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:01,300 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 13:57:01,301 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 13:57:01,301 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 13:57:01,302 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:01,566 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 13:57:01,567 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 13:57:01,567 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 13:57:01,568 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:01,824 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 13:57:01,825 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 13:57:01,826 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 13:57:01,827 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:02,055 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-22 13:57:02,056 INFO L343 Elim1Store]: treesize reduction 48, result has 74.6 percent of original size [2019-11-22 13:57:02,056 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 13:57:02,057 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:02,332 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2019-11-22 13:57:02,332 INFO L567 ElimStorePlain]: treesize reduction 480, result has 33.0 percent of original size [2019-11-22 13:57:02,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:02,333 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:252, output treesize:11 [2019-11-22 13:57:02,355 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 13:57:02,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:57:02,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2019-11-22 13:57:02,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810790477] [2019-11-22 13:57:02,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-22 13:57:02,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:57:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-22 13:57:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-11-22 13:57:02,357 INFO L87 Difference]: Start difference. First operand 457 states and 593 transitions. Second operand 20 states. [2019-11-22 13:57:02,540 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-11-22 13:57:03,196 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-22 13:57:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:03,743 INFO L93 Difference]: Finished difference Result 510 states and 629 transitions. [2019-11-22 13:57:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 13:57:03,743 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-11-22 13:57:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:03,746 INFO L225 Difference]: With dead ends: 510 [2019-11-22 13:57:03,746 INFO L226 Difference]: Without dead ends: 498 [2019-11-22 13:57:03,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-11-22 13:57:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-22 13:57:03,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 449. [2019-11-22 13:57:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-22 13:57:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 562 transitions. [2019-11-22 13:57:03,765 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 562 transitions. Word has length 44 [2019-11-22 13:57:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:03,765 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-11-22 13:57:03,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-22 13:57:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 562 transitions. [2019-11-22 13:57:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 13:57:03,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:03,766 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 13:57:03,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:03,970 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 13:57:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 848721050, now seen corresponding path program 1 times [2019-11-22 13:57:03,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:57:03,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741242612] [2019-11-22 13:57:03,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:57:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:04,825 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 13:57:04,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741242612] [2019-11-22 13:57:04,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802042318] [2019-11-22 13:57:04,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:04,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 13:57:04,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:05,199 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 13:57:05,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:05,201 INFO L567 ElimStorePlain]: treesize reduction 4, result has 20.0 percent of original size [2019-11-22 13:57:05,202 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 13:57:05,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:1 [2019-11-22 13:57:05,211 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 13:57:05,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:57:05,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 27 [2019-11-22 13:57:05,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376689539] [2019-11-22 13:57:05,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 13:57:05,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:57:05,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 13:57:05,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-11-22 13:57:05,213 INFO L87 Difference]: Start difference. First operand 449 states and 562 transitions. Second operand 27 states. [2019-11-22 13:57:05,532 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-11-22 13:57:05,747 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-11-22 13:57:05,970 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2019-11-22 13:57:06,210 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-11-22 13:57:06,463 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-11-22 13:57:06,892 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-22 13:57:07,239 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-11-22 13:57:07,532 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-22 13:57:07,697 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-11-22 13:57:07,879 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-11-22 13:57:08,063 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-22 13:57:08,249 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-11-22 13:57:08,585 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-22 13:57:08,781 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-22 13:57:08,990 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-22 13:57:09,328 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-22 13:57:09,491 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-22 13:57:09,992 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 13:57:10,147 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-22 13:57:10,449 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-22 13:57:10,737 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-11-22 13:57:10,894 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-22 13:57:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:11,267 INFO L93 Difference]: Finished difference Result 703 states and 859 transitions. [2019-11-22 13:57:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-22 13:57:11,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-11-22 13:57:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:11,272 INFO L225 Difference]: With dead ends: 703 [2019-11-22 13:57:11,272 INFO L226 Difference]: Without dead ends: 703 [2019-11-22 13:57:11,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=676, Invalid=2630, Unknown=0, NotChecked=0, Total=3306 [2019-11-22 13:57:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-22 13:57:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 602. [2019-11-22 13:57:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-22 13:57:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 764 transitions. [2019-11-22 13:57:11,292 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 764 transitions. Word has length 45 [2019-11-22 13:57:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:11,293 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 764 transitions. [2019-11-22 13:57:11,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 13:57:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 764 transitions. [2019-11-22 13:57:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 13:57:11,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:11,294 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:57:11,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:11,498 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 13:57:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1632248471, now seen corresponding path program 1 times [2019-11-22 13:57:11,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:57:11,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697061496] [2019-11-22 13:57:11,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:57:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:11,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697061496] [2019-11-22 13:57:11,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944221155] [2019-11-22 13:57:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:57:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:12,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-22 13:57:12,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:12,113 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 8=[|v_#valid_57|]} [2019-11-22 13:57:12,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:12,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:12,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:12,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:12,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:12,288 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-22 13:57:12,289 INFO L343 Elim1Store]: treesize reduction 86, result has 52.7 percent of original size [2019-11-22 13:57:12,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:57:12,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:12,418 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-22 13:57:12,419 INFO L567 ElimStorePlain]: treesize reduction 50, result has 68.6 percent of original size [2019-11-22 13:57:12,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:12,440 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 13:57:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:12,625 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2019-11-22 13:57:12,626 INFO L567 ElimStorePlain]: treesize reduction 513, result has 16.0 percent of original size [2019-11-22 13:57:12,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:12,636 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:98 [2019-11-22 13:57:12,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:12,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:13,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 106 [2019-11-22 13:57:13,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 75 [2019-11-22 13:57:13,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2019-11-22 13:57:13,260 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,349 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 149 [2019-11-22 13:57:13,351 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:13,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:13,366 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:13,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 82 [2019-11-22 13:57:13,383 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 106 [2019-11-22 13:57:13,432 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,437 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:13,437 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:13,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 98 [2019-11-22 13:57:13,485 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:13,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:57:13,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 85 [2019-11-22 13:57:13,516 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2019-11-22 13:57:13,528 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:13,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:13,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2019-11-22 13:57:13,560 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,565 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:13,566 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,572 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:57:13,572 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:13,770 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-22 13:57:13,771 INFO L567 ElimStorePlain]: treesize reduction 297, result has 33.0 percent of original size [2019-11-22 13:57:13,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 13:57:13,772 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:951, output treesize:67 [2019-11-22 13:57:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:14,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:15,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:15,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:15,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 192 [2019-11-22 13:57:15,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:15,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:15,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:15,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 192 [2019-11-22 13:57:15,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:15,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:15,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:15,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:15,400 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:15,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:15,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:15,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 138 [2019-11-22 13:57:15,498 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:15,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:15,672 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 13:57:15,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:15,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 200 [2019-11-22 13:57:15,674 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:15,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:15,886 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-22 13:57:15,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:15,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 246 [2019-11-22 13:57:15,889 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:15,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:15,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:15,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 100 [2019-11-22 13:57:15,957 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:15,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:16,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:16,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:16,065 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:16,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:16,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:16,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 188 [2019-11-22 13:57:16,214 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:16,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:16,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:16,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 100 [2019-11-22 13:57:16,283 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:16,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:16,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:16,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 188 [2019-11-22 13:57:16,429 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:16,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:16,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:16,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:16,540 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:16,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:16,628 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:16,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 13:57:16,630 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,265 WARN L192 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2019-11-22 13:57:17,266 INFO L567 ElimStorePlain]: treesize reduction 1350, result has 20.5 percent of original size [2019-11-22 13:57:17,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2019-11-22 13:57:17,273 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-11-22 13:57:17,296 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2019-11-22 13:57:17,309 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-11-22 13:57:17,315 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2019-11-22 13:57:17,322 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,493 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-22 13:57:17,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:17,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2019-11-22 13:57:17,502 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-11-22 13:57:17,510 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2019-11-22 13:57:17,516 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-11-22 13:57:17,523 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2019-11-22 13:57:17,529 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:17,688 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-22 13:57:17,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:17,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2019-11-22 13:57:17,706 INFO L221 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:795, output treesize:278 [2019-11-22 13:57:17,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:18,066 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-22 13:57:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:18,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:57:18,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-11-22 13:57:18,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820299479] [2019-11-22 13:57:18,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 13:57:18,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:57:18,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 13:57:18,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-22 13:57:18,189 INFO L87 Difference]: Start difference. First operand 602 states and 764 transitions. Second operand 23 states. [2019-11-22 13:57:19,258 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-11-22 13:57:19,611 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-22 13:57:19,771 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 13:57:20,113 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-11-22 13:57:21,433 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-11-22 13:57:37,927 WARN L192 SmtUtils]: Spent 6.79 s on a formula simplification. DAG size of input: 226 DAG size of output: 184 [2019-11-22 13:57:40,484 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-22 13:57:42,476 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-11-22 13:58:08,051 WARN L192 SmtUtils]: Spent 4.95 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2019-11-22 13:58:33,930 WARN L192 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-22 13:58:36,554 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 148 [2019-11-22 13:58:39,359 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2019-11-22 13:58:50,402 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-22 13:58:51,073 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2019-11-22 13:58:54,869 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-11-22 13:59:07,884 WARN L192 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 169 DAG size of output: 131 [2019-11-22 13:59:09,784 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-22 13:59:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:13,333 INFO L93 Difference]: Finished difference Result 731 states and 875 transitions. [2019-11-22 13:59:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-22 13:59:13,333 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-22 13:59:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:13,337 INFO L225 Difference]: With dead ends: 731 [2019-11-22 13:59:13,337 INFO L226 Difference]: Without dead ends: 731 [2019-11-22 13:59:13,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 62.9s TimeCoverageRelationStatistics Valid=577, Invalid=1855, Unknown=18, NotChecked=0, Total=2450 [2019-11-22 13:59:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-22 13:59:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 648. [2019-11-22 13:59:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-11-22 13:59:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 802 transitions. [2019-11-22 13:59:13,356 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 802 transitions. Word has length 39 [2019-11-22 13:59:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:13,357 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 802 transitions. [2019-11-22 13:59:13,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 13:59:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 802 transitions. [2019-11-22 13:59:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 13:59:13,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:13,358 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:13,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:13,562 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 13:59:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash 801064558, now seen corresponding path program 1 times [2019-11-22 13:59:13,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:13,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998598812] [2019-11-22 13:59:13,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:14,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998598812] [2019-11-22 13:59:14,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41128835] [2019-11-22 13:59:14,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:14,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-22 13:59:14,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:14,591 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 15=[|v_#valid_58|]} [2019-11-22 13:59:14,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,664 INFO L343 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2019-11-22 13:59:14,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 37 [2019-11-22 13:59:14,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:14,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:14,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:14,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:14,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, 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 13:59:14,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:14,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:14,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:14,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:14,857 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-11-22 13:59:14,858 INFO L567 ElimStorePlain]: treesize reduction 283, result has 26.9 percent of original size [2019-11-22 13:59:14,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:14,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:104 [2019-11-22 13:59:14,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:14,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 76 [2019-11-22 13:59:14,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:15,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:15,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:15,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:53 [2019-11-22 13:59:15,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:15,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:15,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 168 [2019-11-22 13:59:15,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:15,775 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-11-22 13:59:15,775 INFO L567 ElimStorePlain]: treesize reduction 84, result has 61.5 percent of original size [2019-11-22 13:59:15,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:15,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:107, output treesize:134 [2019-11-22 13:59:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:15,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:16,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:16,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:16,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:16,283 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-22 13:59:16,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:16,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2019-11-22 13:59:16,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,067 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-22 13:59:17,067 INFO L567 ElimStorePlain]: treesize reduction 28, result has 84.3 percent of original size [2019-11-22 13:59:17,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2019-11-22 13:59:17,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:17,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2019-11-22 13:59:17,133 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:17,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2019-11-22 13:59:17,190 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:17,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:17,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 13:59:17,236 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:208, output treesize:84 [2019-11-22 13:59:17,462 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-22 13:59:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:17,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:17,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2019-11-22 13:59:17,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949424931] [2019-11-22 13:59:17,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-22 13:59:17,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-22 13:59:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-11-22 13:59:17,497 INFO L87 Difference]: Start difference. First operand 648 states and 802 transitions. Second operand 28 states. [2019-11-22 13:59:17,782 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-22 13:59:18,056 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-11-22 13:59:18,446 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-22 13:59:18,859 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-22 13:59:19,131 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-11-22 13:59:19,399 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-22 13:59:19,990 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-11-22 13:59:20,372 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-22 13:59:20,659 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-22 13:59:21,013 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-11-22 13:59:21,571 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 129 [2019-11-22 13:59:22,369 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-11-22 13:59:23,245 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2019-11-22 13:59:23,839 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-11-22 13:59:24,212 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2019-11-22 13:59:24,952 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-11-22 13:59:25,472 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-22 13:59:26,149 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-22 13:59:26,583 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-22 13:59:27,207 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-11-22 13:59:27,521 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 13:59:27,834 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-22 13:59:28,420 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-22 13:59:29,477 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-11-22 13:59:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:29,732 INFO L93 Difference]: Finished difference Result 716 states and 850 transitions. [2019-11-22 13:59:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-22 13:59:29,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-22 13:59:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:29,735 INFO L225 Difference]: With dead ends: 716 [2019-11-22 13:59:29,735 INFO L226 Difference]: Without dead ends: 716 [2019-11-22 13:59:29,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=884, Invalid=3148, Unknown=0, NotChecked=0, Total=4032 [2019-11-22 13:59:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-22 13:59:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 647. [2019-11-22 13:59:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-22 13:59:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 792 transitions. [2019-11-22 13:59:29,754 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 792 transitions. Word has length 45 [2019-11-22 13:59:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:29,754 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 792 transitions. [2019-11-22 13:59:29,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-22 13:59:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 792 transitions. [2019-11-22 13:59:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-22 13:59:29,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:29,756 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:29,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:29,960 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 13:59:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1038016890, now seen corresponding path program 1 times [2019-11-22 13:59:29,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:29,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481695113] [2019-11-22 13:59:29,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:30,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481695113] [2019-11-22 13:59:30,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124088494] [2019-11-22 13:59:30,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 13:59:30,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:30,447 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 13:59:30,447 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 13:59:30,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 13:59:30,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:30,500 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 13:59:30,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:30,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:30,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 13:59:30,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:30,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:30,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:30,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:31,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:31,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:31,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 13:59:31,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,151 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,151 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,152 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,152 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,153 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,153 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,154 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,154 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,155 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,155 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:31,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,157 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 13:59:31,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:31,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:31,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 34 treesize of output 142 [2019-11-22 13:59:31,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,423 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,424 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,424 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,425 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,425 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,426 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,426 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,427 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,427 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,428 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:31,428 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:31,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:31,429 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 13:59:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:31,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 13:59:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:31,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:31,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 13:59:31,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497401014] [2019-11-22 13:59:31,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:59:31,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:59:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:59:31,691 INFO L87 Difference]: Start difference. First operand 647 states and 792 transitions. Second operand 12 states. [2019-11-22 13:59:32,052 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 13:59:32,883 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 13:59:33,064 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-22 13:59:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:37,291 INFO L93 Difference]: Finished difference Result 686 states and 831 transitions. [2019-11-22 13:59:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:37,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-22 13:59:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:37,296 INFO L225 Difference]: With dead ends: 686 [2019-11-22 13:59:37,296 INFO L226 Difference]: Without dead ends: 686 [2019-11-22 13:59:37,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:59:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-22 13:59:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 647. [2019-11-22 13:59:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-22 13:59:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 789 transitions. [2019-11-22 13:59:37,313 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 789 transitions. Word has length 54 [2019-11-22 13:59:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:37,313 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 789 transitions. [2019-11-22 13:59:37,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:59:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 789 transitions. [2019-11-22 13:59:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-22 13:59:37,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:37,316 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 13:59:37,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:37,520 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 13:59:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1091323427, now seen corresponding path program 1 times [2019-11-22 13:59:37,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:37,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271687995] [2019-11-22 13:59:37,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,686 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 13:59:37,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271687995] [2019-11-22 13:59:37,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:37,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 13:59:37,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721929287] [2019-11-22 13:59:37,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 13:59:37,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 13:59:37,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:59:37,688 INFO L87 Difference]: Start difference. First operand 647 states and 789 transitions. Second operand 9 states. [2019-11-22 13:59:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:38,138 INFO L93 Difference]: Finished difference Result 397 states and 447 transitions. [2019-11-22 13:59:38,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:59:38,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-22 13:59:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:38,141 INFO L225 Difference]: With dead ends: 397 [2019-11-22 13:59:38,141 INFO L226 Difference]: Without dead ends: 388 [2019-11-22 13:59:38,141 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 13:59:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-22 13:59:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 365. [2019-11-22 13:59:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-22 13:59:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 416 transitions. [2019-11-22 13:59:38,150 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 416 transitions. Word has length 55 [2019-11-22 13:59:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:38,150 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 416 transitions. [2019-11-22 13:59:38,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 13:59:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 416 transitions. [2019-11-22 13:59:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-22 13:59:38,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:38,152 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 13:59:38,152 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 13:59:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1141925511, now seen corresponding path program 1 times [2019-11-22 13:59:38,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:38,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437911578] [2019-11-22 13:59:38,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,272 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 13:59:38,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437911578] [2019-11-22 13:59:38,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286196197] [2019-11-22 13:59:38,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-22 13:59:38,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:38,429 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 13:59:38,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:38,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-22 13:59:38,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984162193] [2019-11-22 13:59:38,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:59:38,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:38,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:59:38,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:38,431 INFO L87 Difference]: Start difference. First operand 365 states and 416 transitions. Second operand 4 states. [2019-11-22 13:59:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:38,455 INFO L93 Difference]: Finished difference Result 364 states and 413 transitions. [2019-11-22 13:59:38,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:59:38,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-22 13:59:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:38,457 INFO L225 Difference]: With dead ends: 364 [2019-11-22 13:59:38,457 INFO L226 Difference]: Without dead ends: 364 [2019-11-22 13:59:38,457 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 13:59:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-22 13:59:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2019-11-22 13:59:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-22 13:59:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 413 transitions. [2019-11-22 13:59:38,463 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 413 transitions. Word has length 57 [2019-11-22 13:59:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:38,464 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 413 transitions. [2019-11-22 13:59:38,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:59:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 413 transitions. [2019-11-22 13:59:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-22 13:59:38,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:38,465 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:38,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:38,672 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 13:59:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2113752430, now seen corresponding path program 1 times [2019-11-22 13:59:38,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:38,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392827953] [2019-11-22 13:59:38,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:38,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392827953] [2019-11-22 13:59:38,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347295573] [2019-11-22 13:59:38,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:38,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 13:59:38,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:39,202 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 13:59:39,203 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 13:59:39,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 13:59:39,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,276 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 13:59:39,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:39,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:54 [2019-11-22 13:59:39,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:39,536 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:39,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-22 13:59:39,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-22 13:59:39,637 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:39,665 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:39,679 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:39,708 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:39,722 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 40 [2019-11-22 13:59:39,750 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 43 [2019-11-22 13:59:39,779 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,788 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 13:59:39,794 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,801 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-22 13:59:39,808 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:39,823 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,831 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,831 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,832 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,834 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,835 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,835 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 24 [2019-11-22 13:59:39,841 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:39,851 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:39,860 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,871 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:39,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:39,872 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,881 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:39,882 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:39,891 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,899 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:39,900 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,909 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,909 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,910 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:39,910 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,915 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-22 13:59:39,917 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,924 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,924 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:39,927 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,936 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,936 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:39,940 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,945 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,946 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:39,949 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,954 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,954 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,955 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,956 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,957 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,957 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,958 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:39,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:39,960 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-22 13:59:39,967 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,971 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:39,971 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,975 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:39,976 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,980 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:39,981 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,985 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:39,986 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,990 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:39,990 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:39,994 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:39,994 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,031 INFO L567 ElimStorePlain]: treesize reduction 143, result has 4.7 percent of original size [2019-11-22 13:59:40,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,032 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 13:59:40,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:40,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:40,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-22 13:59:40,191 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:40,204 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,215 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,225 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 13:59:40,226 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,232 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,235 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:40,236 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,249 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-22 13:59:40,249 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,260 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,265 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 24 [2019-11-22 13:59:40,273 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:40,285 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,293 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,294 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 13:59:40,322 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:40,340 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:40,347 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 24 [2019-11-22 13:59:40,364 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:40,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-22 13:59:40,378 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,384 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,386 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:40,386 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:40,395 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:40,405 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,410 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:40,416 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,424 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:40,426 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:40,439 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:40,450 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,454 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,455 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,458 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:40,458 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,463 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,465 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,465 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,466 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,470 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 13:59:40,470 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 13:59:40,480 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,488 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-11-22 13:59:40,491 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:40,499 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-22 13:59:40,511 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,523 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 13:59:40,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 13:59:40,526 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-22 13:59:40,533 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,538 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:40,538 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,543 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:40,543 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,547 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 13:59:40,547 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,572 INFO L567 ElimStorePlain]: treesize reduction 75, result has 8.5 percent of original size [2019-11-22 13:59:40,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:40,572 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 13:59:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,827 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 17 [2019-11-22 13:59:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-22 13:59:40,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:40,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-22 13:59:40,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853312014] [2019-11-22 13:59:40,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:59:40,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:59:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:59:40,866 INFO L87 Difference]: Start difference. First operand 364 states and 413 transitions. Second operand 12 states. [2019-11-22 13:59:41,076 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-22 13:59:41,616 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-22 13:59:41,930 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-22 13:59:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:42,223 INFO L93 Difference]: Finished difference Result 383 states and 430 transitions. [2019-11-22 13:59:42,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:59:42,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-22 13:59:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:42,226 INFO L225 Difference]: With dead ends: 383 [2019-11-22 13:59:42,226 INFO L226 Difference]: Without dead ends: 376 [2019-11-22 13:59:42,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-22 13:59:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-22 13:59:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2019-11-22 13:59:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-22 13:59:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 403 transitions. [2019-11-22 13:59:42,235 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 403 transitions. Word has length 55 [2019-11-22 13:59:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:42,235 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 403 transitions. [2019-11-22 13:59:42,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:59:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 403 transitions. [2019-11-22 13:59:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-22 13:59:42,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:42,237 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 13:59:42,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:42,441 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 13:59:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1039952525, now seen corresponding path program 1 times [2019-11-22 13:59:42,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:42,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581672234] [2019-11-22 13:59:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:42,580 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 13:59:42,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581672234] [2019-11-22 13:59:42,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909878624] [2019-11-22 13:59:42,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:42,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 13:59:42,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:42,755 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 13:59:42,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:42,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-22 13:59:42,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511247568] [2019-11-22 13:59:42,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:59:42,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:59:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:42,757 INFO L87 Difference]: Start difference. First operand 357 states and 403 transitions. Second operand 4 states. [2019-11-22 13:59:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:42,815 INFO L93 Difference]: Finished difference Result 356 states and 399 transitions. [2019-11-22 13:59:42,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:59:42,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-22 13:59:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:42,817 INFO L225 Difference]: With dead ends: 356 [2019-11-22 13:59:42,817 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 13:59:42,818 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 13:59:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 13:59:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2019-11-22 13:59:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-22 13:59:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 399 transitions. [2019-11-22 13:59:42,824 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 399 transitions. Word has length 58 [2019-11-22 13:59:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:42,824 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 399 transitions. [2019-11-22 13:59:42,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:59:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 399 transitions. [2019-11-22 13:59:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-22 13:59:42,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:42,825 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 13:59:43,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:43,029 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 13:59:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2121210039, now seen corresponding path program 1 times [2019-11-22 13:59:43,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:43,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925880147] [2019-11-22 13:59:43,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,145 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 13:59:43,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925880147] [2019-11-22 13:59:43,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561809328] [2019-11-22 13:59:43,146 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 13:59:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 13:59:43,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:43,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:59:43,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:43,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:43,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:43,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 13:59:43,366 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 13:59:43,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:43,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-22 13:59:43,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870461740] [2019-11-22 13:59:43,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:59:43,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:59:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:43,369 INFO L87 Difference]: Start difference. First operand 356 states and 399 transitions. Second operand 4 states. [2019-11-22 13:59:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:43,499 INFO L93 Difference]: Finished difference Result 373 states and 411 transitions. [2019-11-22 13:59:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:59:43,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-22 13:59:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:43,502 INFO L225 Difference]: With dead ends: 373 [2019-11-22 13:59:43,502 INFO L226 Difference]: Without dead ends: 367 [2019-11-22 13:59:43,503 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 13:59:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-11-22 13:59:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 350. [2019-11-22 13:59:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-22 13:59:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 390 transitions. [2019-11-22 13:59:43,512 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 390 transitions. Word has length 59 [2019-11-22 13:59:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:43,514 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 390 transitions. [2019-11-22 13:59:43,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:59:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 390 transitions. [2019-11-22 13:59:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-22 13:59:43,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:43,515 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:43,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:43,723 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 13:59:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2138604831, now seen corresponding path program 1 times [2019-11-22 13:59:43,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:43,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718313061] [2019-11-22 13:59:43,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-22 13:59:44,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718313061] [2019-11-22 13:59:44,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151538960] [2019-11-22 13:59:44,079 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 13:59:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:44,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-22 13:59:44,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:44,251 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 9=[|v_#valid_61|]} [2019-11-22 13:59:44,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,333 INFO L343 Elim1Store]: treesize reduction 142, result has 12.9 percent of original size [2019-11-22 13:59:44,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 13:59:44,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:44,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:44,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:44,384 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 13:59:44,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:44,439 INFO L567 ElimStorePlain]: treesize reduction 13, result has 82.7 percent of original size [2019-11-22 13:59:44,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:44,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:62 [2019-11-22 13:59:44,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:44,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-22 13:59:44,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:44,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:44,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:44,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 13:59:44,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:44,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-22 13:59:44,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:44,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:44,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:44,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 13:59:45,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:59:45,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:45,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 120 [2019-11-22 13:59:45,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:45,164 INFO L567 ElimStorePlain]: treesize reduction 60, result has 54.5 percent of original size [2019-11-22 13:59:45,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-22 13:59:45,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:45,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:45,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-22 13:59:45,206 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:45,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:45,241 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:58 [2019-11-22 13:59:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:45,484 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-22 13:59:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-22 13:59:45,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:45,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2019-11-22 13:59:45,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675418970] [2019-11-22 13:59:45,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 13:59:45,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:45,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 13:59:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:59:45,631 INFO L87 Difference]: Start difference. First operand 350 states and 390 transitions. Second operand 21 states. [2019-11-22 13:59:45,868 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-22 13:59:46,085 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-22 13:59:46,478 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 13:59:46,691 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-22 13:59:47,127 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-22 13:59:47,464 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-22 13:59:47,708 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-22 13:59:48,149 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-22 13:59:48,489 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2019-11-22 13:59:48,881 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 13:59:49,167 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-22 13:59:49,573 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-22 13:59:50,017 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-22 13:59:51,160 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-11-22 13:59:51,849 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-22 13:59:53,292 WARN L192 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 151 [2019-11-22 13:59:54,756 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-22 13:59:58,003 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-11-22 13:59:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:59,429 INFO L93 Difference]: Finished difference Result 372 states and 405 transitions. [2019-11-22 13:59:59,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-22 13:59:59,431 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-11-22 13:59:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:59,432 INFO L225 Difference]: With dead ends: 372 [2019-11-22 13:59:59,432 INFO L226 Difference]: Without dead ends: 372 [2019-11-22 13:59:59,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=541, Invalid=1715, Unknown=0, NotChecked=0, Total=2256 [2019-11-22 13:59:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-22 13:59:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 349. [2019-11-22 13:59:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-22 13:59:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 384 transitions. [2019-11-22 13:59:59,438 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 384 transitions. Word has length 60 [2019-11-22 13:59:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:59,439 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 384 transitions. [2019-11-22 13:59:59,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 13:59:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 384 transitions. [2019-11-22 13:59:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-22 13:59:59,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:59,440 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 13:59:59,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:59,645 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 13:59:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash -201285117, now seen corresponding path program 1 times [2019-11-22 13:59:59,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:59,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127325400] [2019-11-22 13:59:59,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:00,084 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 14:00:00,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127325400] [2019-11-22 14:00:00,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128334409] [2019-11-22 14:00:00,085 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 14:00:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:00,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-22 14:00:00,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:00,579 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 14:00:00,580 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 14:00:00,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 14:00:00,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:00,655 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 14:00:00,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:00,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:00,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 14:00:00,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:00,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:01,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:01,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:01,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:01,906 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 14:00:01,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:01,907 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 14:00:01,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:02,033 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 14:00:02,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,036 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:02,036 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,037 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:02,037 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,038 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:02,038 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,039 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:02,039 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,040 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:02,040 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,050 INFO L567 ElimStorePlain]: treesize reduction 29, result has 9.4 percent of original size [2019-11-22 14:00:02,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,050 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 14:00:02,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:02,229 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 14:00:02,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:02,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 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 14:00:02,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,407 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 14:00:02,407 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:02,408 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 14:00:02,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,581 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 14:00:02,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:02,582 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 14:00:02,584 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:02,760 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 14:00:02,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:02,761 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 14:00:02,762 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:03,002 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 14:00:03,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:03,003 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 14:00:03,005 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:03,179 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 14:00:03,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:03,180 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 14:00:03,181 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:03,326 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 14:00:03,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:03,327 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 14:00:03,328 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:03,477 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-11-22 14:00:03,477 INFO L567 ElimStorePlain]: treesize reduction 77, result has 62.1 percent of original size [2019-11-22 14:00:03,478 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 14:00:03,478 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:261, output treesize:14 [2019-11-22 14:00:03,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 14:00:03,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:03,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:03,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:03,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 14:00:03,530 INFO L343 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2019-11-22 14:00:03,530 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 14:00:03,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-22 14:00:03,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:03,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:03,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-22 14:00:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:03,624 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 14:00:03,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:00:03,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-22 14:00:03,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990239749] [2019-11-22 14:00:03,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-22 14:00:03,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:03,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-22 14:00:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-22 14:00:03,628 INFO L87 Difference]: Start difference. First operand 349 states and 384 transitions. Second operand 20 states. [2019-11-22 14:00:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:39,423 INFO L93 Difference]: Finished difference Result 376 states and 408 transitions. [2019-11-22 14:00:39,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:00:39,424 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2019-11-22 14:00:39,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:39,425 INFO L225 Difference]: With dead ends: 376 [2019-11-22 14:00:39,426 INFO L226 Difference]: Without dead ends: 376 [2019-11-22 14:00:39,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-11-22 14:00:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-22 14:00:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 348. [2019-11-22 14:00:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-22 14:00:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 383 transitions. [2019-11-22 14:00:39,431 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 383 transitions. Word has length 70 [2019-11-22 14:00:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:39,432 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 383 transitions. [2019-11-22 14:00:39,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-22 14:00:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 383 transitions. [2019-11-22 14:00:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-22 14:00:39,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:39,434 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 14:00:39,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:39,635 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 14:00:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1944871311, now seen corresponding path program 1 times [2019-11-22 14:00:39,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:39,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528923848] [2019-11-22 14:00:39,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:40,697 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 14:00:40,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528923848] [2019-11-22 14:00:40,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919363236] [2019-11-22 14:00:40,698 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 14:00:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:40,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-22 14:00:40,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:40,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 14:00:40,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:40,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:40,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:40,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-22 14:00:41,066 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:41,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-22 14:00:41,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:41,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:41,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:41,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-22 14:00:41,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-22 14:00:41,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:41,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:41,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:41,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2019-11-22 14:00:41,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:41,450 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 14:00:41,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:41,472 INFO L567 ElimStorePlain]: treesize reduction 18, result has 61.7 percent of original size [2019-11-22 14:00:41,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:41,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:29 [2019-11-22 14:00:41,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:41,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-22 14:00:41,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:41,713 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-22 14:00:41,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:41,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-22 14:00:41,797 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 14:00:41,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:00:41,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2019-11-22 14:00:41,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135836421] [2019-11-22 14:00:41,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-22 14:00:41,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-22 14:00:41,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2019-11-22 14:00:41,799 INFO L87 Difference]: Start difference. First operand 348 states and 383 transitions. Second operand 43 states. [2019-11-22 14:00:42,078 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-22 14:00:42,265 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-22 14:00:42,470 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-11-22 14:00:42,775 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-22 14:00:43,495 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-22 14:00:43,656 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-11-22 14:00:43,853 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-11-22 14:00:44,045 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 14:00:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:45,350 INFO L93 Difference]: Finished difference Result 391 states and 421 transitions. [2019-11-22 14:00:45,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 14:00:45,351 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2019-11-22 14:00:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:45,354 INFO L225 Difference]: With dead ends: 391 [2019-11-22 14:00:45,354 INFO L226 Difference]: Without dead ends: 391 [2019-11-22 14:00:45,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=570, Invalid=3090, Unknown=0, NotChecked=0, Total=3660 [2019-11-22 14:00:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-22 14:00:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 348. [2019-11-22 14:00:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-22 14:00:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 382 transitions. [2019-11-22 14:00:45,372 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 382 transitions. Word has length 71 [2019-11-22 14:00:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:45,373 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 382 transitions. [2019-11-22 14:00:45,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-22 14:00:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 382 transitions. [2019-11-22 14:00:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-22 14:00:45,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:45,374 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 14:00:45,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:45,579 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 14:00:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash -710553421, now seen corresponding path program 1 times [2019-11-22 14:00:45,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:45,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274494566] [2019-11-22 14:00:45,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:46,061 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 14:00:46,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274494566] [2019-11-22 14:00:46,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692307423] [2019-11-22 14:00:46,061 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 14:00:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:46,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-22 14:00:46,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:46,403 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 14:00:46,404 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 14:00:46,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 14:00:46,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,465 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-11-22 14:00:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:46,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:46,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:58 [2019-11-22 14:00:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:46,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:46,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:46,792 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 14:00:46,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,795 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:46,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,799 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:46,799 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,802 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:46,803 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,806 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:46,806 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,809 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:46,810 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,812 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:00:46,812 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:46,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:46,818 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:271, output treesize:7 [2019-11-22 14:00:46,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:00:46,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:47,135 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:00:47,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:47,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:00:47,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:47,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:47,379 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:00:47,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:47,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:00:47,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:47,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:47,724 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-22 14:00:47,725 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:47,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 47 treesize of output 319 [2019-11-22 14:00:47,728 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:47,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:47,965 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:00:47,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:47,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:00:47,968 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:48,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:48,205 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:00:48,206 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:48,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 252 [2019-11-22 14:00:48,208 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:48,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:48,447 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:00:48,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:48,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 42 treesize of output 249 [2019-11-22 14:00:48,449 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:48,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:48,667 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 14:00:48,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:48,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 252 [2019-11-22 14:00:48,670 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:49,057 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-11-22 14:00:49,058 INFO L567 ElimStorePlain]: treesize reduction 668, result has 27.9 percent of original size [2019-11-22 14:00:49,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-22 14:00:49,059 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:306, output treesize:89 [2019-11-22 14:00:49,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:49,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:49,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 64 [2019-11-22 14:00:49,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:49,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:49,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:49,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:49,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 64 [2019-11-22 14:00:49,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:49,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:49,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 14:00:49,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:23 [2019-11-22 14:00:49,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 14:00:49,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:49,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:49,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:49,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 14:00:49,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:49,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:49,507 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-22 14:00:49,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 14:00:49,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:49,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:49,608 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-22 14:00:49,609 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 14:00:49,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:49,702 INFO L567 ElimStorePlain]: treesize reduction 76, result has 44.5 percent of original size [2019-11-22 14:00:49,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:49,704 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 14:00:49,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-11-22 14:00:49,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:49,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:49,913 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 14:00:49,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:00:49,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2019-11-22 14:00:49,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5253226] [2019-11-22 14:00:49,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-22 14:00:49,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-22 14:00:49,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2019-11-22 14:00:49,915 INFO L87 Difference]: Start difference. First operand 348 states and 382 transitions. Second operand 28 states. [2019-11-22 14:00:50,282 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-11-22 14:00:50,595 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-11-22 14:00:51,778 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-11-22 14:00:52,064 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-11-22 14:00:52,690 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 101 [2019-11-22 14:00:53,020 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 108 [2019-11-22 14:00:53,556 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-11-22 14:00:53,822 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-22 14:00:54,399 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-11-22 14:00:54,578 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-22 14:00:54,803 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-22 14:00:55,486 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-11-22 14:00:55,880 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 111 [2019-11-22 14:00:56,108 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-11-22 14:00:56,563 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 111 [2019-11-22 14:00:56,817 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2019-11-22 14:00:57,252 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-22 14:00:58,258 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-11-22 14:00:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:59,489 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-11-22 14:00:59,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-22 14:00:59,490 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2019-11-22 14:00:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:59,492 INFO L225 Difference]: With dead ends: 376 [2019-11-22 14:00:59,493 INFO L226 Difference]: Without dead ends: 376 [2019-11-22 14:00:59,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=572, Invalid=2850, Unknown=0, NotChecked=0, Total=3422 [2019-11-22 14:00:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-22 14:00:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 347. [2019-11-22 14:00:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-22 14:00:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 381 transitions. [2019-11-22 14:00:59,500 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 381 transitions. Word has length 73 [2019-11-22 14:00:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:59,501 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 381 transitions. [2019-11-22 14:00:59,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-22 14:00:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 381 transitions. [2019-11-22 14:00:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-22 14:00:59,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:59,503 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:59,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:59,706 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 14:00:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash -148206892, now seen corresponding path program 1 times [2019-11-22 14:00:59,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:59,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362656261] [2019-11-22 14:00:59,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 14:00:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 14:00:59,816 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-22 14:00:59,817 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-22 14:00:59,850 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-22 14:00:59,858 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-22 14:00:59,858 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-22 14:00:59,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:00:59 BoogieIcfgContainer [2019-11-22 14:00:59,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:00:59,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:00:59,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:00:59,933 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:00:59,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:54:35" (3/4) ... [2019-11-22 14:00:59,937 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-22 14:00:59,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:00:59,939 INFO L168 Benchmark]: Toolchain (without parser) took 385623.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 951.0 MB in the beginning and 927.3 MB in the end (delta: 23.6 MB). Peak memory consumption was 314.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:59,939 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:00:59,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:59,940 INFO L168 Benchmark]: Boogie Preprocessor took 90.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:00:59,940 INFO L168 Benchmark]: RCFGBuilder took 754.50 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: 69.5 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:59,940 INFO L168 Benchmark]: TraceAbstraction took 384079.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.0 GB in the beginning and 927.3 MB in the end (delta: 119.2 MB). Peak memory consumption was 257.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:59,945 INFO L168 Benchmark]: Witness Printer took 7.44 ms. Allocated memory is still 1.3 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:00:59,946 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.08 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 754.50 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: 69.5 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 384079.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.0 GB in the beginning and 927.3 MB in the end (delta: 119.2 MB). Peak memory consumption was 257.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.44 ms. Allocated memory is still 1.3 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## - 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## * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [\old(commands)=null, \old(commands)=null, \old(global)=117, \old(global)=120, \old(state)=109, commands={7:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={4:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L722] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L723] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={9:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L723] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L724] CALL parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={10:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].state_needed=0, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L695] CALL commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L702] char *x = (char *)malloc(sizeof(char)); VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L703] COND FALSE !(!x) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, malloc(sizeof(char))={1:0}, state=1, x={1:0}] [L695] RET commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={1:0}, i=0, input={10:0}, input={10:0}, state=1] [L724] RET parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, state=1] [L725] return 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, \result=0, commands={7:0}, global={1:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 79 locations, 20 error locations. Result: UNSAFE, OverallTime: 384.0s, OverallIterations: 35, TraceHistogramMax: 5, AutomataDifference: 303.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1659 SDtfs, 12216 SDslu, 3336 SDs, 0 SdLazy, 17349 SolverSat, 4171 SolverUnsat, 67 SolverUnknown, 0 SolverNotchecked, 129.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1723 GetRequests, 930 SyntacticMatches, 79 SemanticMatches, 714 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7107 ImplicationChecksByTransitivity, 167.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.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 1106 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 70.5s 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-3d056a1 [2019-11-22 14:01:01,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:01:01,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:01:01,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:01:01,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:01:01,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:01:01,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:01:01,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:01:01,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:01:01,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:01:01,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:01:01,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:01:01,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:01:01,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:01:01,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:01:01,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:01:01,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:01:01,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:01:01,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:01:01,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:01:01,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:01:01,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:01:01,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:01:01,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:01:01,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:01:01,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:01:01,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:01:01,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:01:01,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:01:01,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:01:01,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:01:01,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:01:01,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:01:01,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:01:01,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:01:01,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:01:01,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:01:01,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:01:01,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:01:01,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:01:01,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:01:01,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 14:01:01,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:01:01,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:01:01,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:01:01,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:01:01,898 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:01:01,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:01:01,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:01:01,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:01:01,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:01:01,900 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:01:01,901 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:01:01,901 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:01:01,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:01:01,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:01:01,902 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 14:01:01,902 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 14:01:01,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:01:01,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:01:01,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:01:01,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:01:01,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:01:01,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:01:01,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:01:01,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:01:01,905 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 14:01:01,905 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 14:01:01,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 14:01:01,906 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 14:01:02,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:01:02,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:01:02,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:01:02,212 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:01:02,213 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:01:02,213 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 14:01:02,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa3e8a11/62080c066bf048589cd89c7414caafa4/FLAGbdf21de32 [2019-11-22 14:01:02,799 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:01:02,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2019-11-22 14:01:02,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa3e8a11/62080c066bf048589cd89c7414caafa4/FLAGbdf21de32 [2019-11-22 14:01:03,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa3e8a11/62080c066bf048589cd89c7414caafa4 [2019-11-22 14:01:03,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:01:03,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:01:03,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:01:03,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:01:03,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:01:03,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fa7263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03, skipping insertion in model container [2019-11-22 14:01:03,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:01:03,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:01:03,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:01:03,630 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:01:03,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:01:03,821 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:01:03,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03 WrapperNode [2019-11-22 14:01:03,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:01:03,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:01:03,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:01:03,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:01:03,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... [2019-11-22 14:01:03,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:01:03,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:01:03,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:01:03,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:01:03,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:01:03,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:01:03,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:01:03,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 14:01:03,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:01:03,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 14:01:03,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 14:01:03,974 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 14:01:03,974 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 14:01:03,975 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 14:01:03,975 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:01:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 14:01:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 14:01:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 14:01:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 14:01:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 14:01:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 14:01:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 14:01:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 14:01:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 14:01:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 14:01:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 14:01:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 14:01:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 14:01:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 14:01:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 14:01:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 14:01:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 14:01:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 14:01:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 14:01:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 14:01:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 14:01:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 14:01:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 14:01:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 14:01:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 14:01:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 14:01:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 14:01:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 14:01:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 14:01:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 14:01:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 14:01:03,988 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 14:01:03,988 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 14:01:03,988 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 14:01:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 14:01:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 14:01:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 14:01:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 14:01:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 14:01:03,991 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 14:01:03,991 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 14:01:03,991 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 14:01:03,991 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 14:01:03,991 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 14:01:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 14:01:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 14:01:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 14:01:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 14:01:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 14:01:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 14:01:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 14:01:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 14:01:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 14:01:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:01:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 14:01:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:01:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 14:01:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 14:01:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 14:01:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 14:01:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 14:01:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 14:01:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 14:01:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 14:01:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 14:01:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 14:01:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 14:01:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 14:01:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 14:01:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 14:01:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 14:01:04,001 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 14:01:04,002 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 14:01:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 14:01:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 14:01:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 14:01:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 14:01:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 14:01:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 14:01:04,005 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 14:01:04,005 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 14:01:04,005 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 14:01:04,005 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 14:01:04,006 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 14:01:04,006 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 14:01:04,006 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 14:01:04,006 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 14:01:04,006 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 14:01:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 14:01:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 14:01:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 14:01:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 14:01:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 14:01:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 14:01:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 14:01:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 14:01:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 14:01:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 14:01:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 14:01:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 14:01:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 14:01:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 14:01:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 14:01:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 14:01:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 14:01:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 14:01:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 14:01:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 14:01:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 14:01:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 14:01:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 14:01:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 14:01:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 14:01:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 14:01:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 14:01:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 14:01:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 14:01:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 14:01:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 14:01:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 14:01:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 14:01:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 14:01:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 14:01:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 14:01:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 14:01:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 14:01:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 14:01:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 14:01:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:01:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:01:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:01:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:01:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 14:01:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 14:01:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:01:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 14:01:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 14:01:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 14:01:04,822 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:01:04,822 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 14:01:04,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:01:04 BoogieIcfgContainer [2019-11-22 14:01:04,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:01:04,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:01:04,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:01:04,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:01:04,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:01:03" (1/3) ... [2019-11-22 14:01:04,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de5c2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:01:04, skipping insertion in model container [2019-11-22 14:01:04,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:01:03" (2/3) ... [2019-11-22 14:01:04,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de5c2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:01:04, skipping insertion in model container [2019-11-22 14:01:04,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:01:04" (3/3) ... [2019-11-22 14:01:04,833 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2019-11-22 14:01:04,842 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:01:04,850 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 14:01:04,862 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 14:01:04,882 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:01:04,883 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:01:04,883 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:01:04,883 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:01:04,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:01:04,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:01:04,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:01:04,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:01:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 14:01:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:01:04,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:04,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:04,913 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 14:01:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 14:01:04,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:04,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [819716857] [2019-11-22 14:01:04,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:05,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 14:01:05,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:05,738 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 14:01:05,741 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 14:01:05,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-22 14:01:05,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:05,833 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 14:01:05,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:05,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:05,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 14:01:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:05,899 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:05,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [819716857] [2019-11-22 14:01:05,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:05,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 14:01:05,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190945871] [2019-11-22 14:01:05,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:01:05,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:05,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:01:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:05,983 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 14:01:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:06,153 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-22 14:01:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:01:06,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 14:01:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:06,167 INFO L225 Difference]: With dead ends: 88 [2019-11-22 14:01:06,168 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 14:01:06,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:06,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 14:01:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-11-22 14:01:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-22 14:01:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-22 14:01:06,224 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 9 [2019-11-22 14:01:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:06,225 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-22 14:01:06,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:01:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-22 14:01:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 14:01:06,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:06,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:06,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:06,440 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 14:01:06,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:06,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 14:01:06,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:06,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [122297665] [2019-11-22 14:01:06,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:06,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 14:01:06,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:07,155 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 14:01:07,156 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 14:01:07,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 14:01:07,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:07,297 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 14:01:07,298 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 14:01:07,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:01:07,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 14:01:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:07,342 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:07,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122297665] [2019-11-22 14:01:07,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:07,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 14:01:07,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202814574] [2019-11-22 14:01:07,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:01:07,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:01:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:01:07,574 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2019-11-22 14:01:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:08,276 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2019-11-22 14:01:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:01:08,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 14:01:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:08,280 INFO L225 Difference]: With dead ends: 164 [2019-11-22 14:01:08,280 INFO L226 Difference]: Without dead ends: 164 [2019-11-22 14:01:08,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:01:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-22 14:01:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2019-11-22 14:01:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-22 14:01:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2019-11-22 14:01:08,306 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 9 [2019-11-22 14:01:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:08,307 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2019-11-22 14:01:08,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:01:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2019-11-22 14:01:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:01:08,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:08,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:08,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:08,512 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 14:01:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 14:01:08,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:08,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1811282108] [2019-11-22 14:01:08,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:08,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 14:01:08,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:09,471 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 14:01:09,473 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 14:01:09,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 325 treesize of output 419 [2019-11-22 14:01:09,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:09,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:10,796 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-22 14:01:10,797 INFO L567 ElimStorePlain]: treesize reduction 6909, result has 2.3 percent of original size [2019-11-22 14:01:10,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:10,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:10,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 14:01:10,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:10,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:10,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:11,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:11,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:11,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:11,503 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-11-22 14:01:11,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 44 [2019-11-22 14:01:11,528 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:11,654 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-22 14:01:11,656 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.3 percent of original size [2019-11-22 14:01:11,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:11,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:124, output treesize:70 [2019-11-22 14:01:11,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 14:01:11,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:12,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1811282108] [2019-11-22 14:01:12,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:12,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:01:12,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255604469] [2019-11-22 14:01:12,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:01:12,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:01:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:01:12,136 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand 8 states. [2019-11-22 14:01:12,388 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-22 14:01:12,660 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 14:01:13,122 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-11-22 14:01:13,855 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-11-22 14:01:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:14,560 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2019-11-22 14:01:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 14:01:14,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 14:01:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:14,565 INFO L225 Difference]: With dead ends: 277 [2019-11-22 14:01:14,565 INFO L226 Difference]: Without dead ends: 277 [2019-11-22 14:01:14,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:01:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-22 14:01:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 205. [2019-11-22 14:01:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-22 14:01:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2019-11-22 14:01:14,594 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 10 [2019-11-22 14:01:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:14,594 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2019-11-22 14:01:14,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:01:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2019-11-22 14:01:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 14:01:14,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:14,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:14,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:14,800 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 14:01:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:14,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 14:01:14,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:14,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [75148606] [2019-11-22 14:01:14,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:15,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 14:01:15,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:15,353 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 14:01:15,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:15,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:15,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:15,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:15,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:15,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:15,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:15,771 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 14:01:15,771 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 14:01:15,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 141 [2019-11-22 14:01:15,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:16,090 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 14:01:16,091 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 14:01:16,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:16,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 288 [2019-11-22 14:01:16,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:16,217 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,152 WARN L192 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 68 [2019-11-22 14:01:17,152 INFO L567 ElimStorePlain]: treesize reduction 2940, result has 5.0 percent of original size [2019-11-22 14:01:17,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:17,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 14:01:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:17,348 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:17,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:17,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2019-11-22 14:01:17,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:17,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 14:01:17,415 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,437 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 14:01:17,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 14:01:17,440 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:17,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2019-11-22 14:01:17,469 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:17,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 14:01:17,511 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,525 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:17,525 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 14:01:17,560 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,571 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:17,572 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2019-11-22 14:01:17,599 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:17,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 131 [2019-11-22 14:01:17,637 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:17,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:17,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 14:01:17,661 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:18,227 WARN L192 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 14:01:18,228 INFO L567 ElimStorePlain]: treesize reduction 698, result has 31.2 percent of original size [2019-11-22 14:01:18,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 14:01:18,230 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1531, output treesize:316 [2019-11-22 14:01:18,609 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 14:01:18,935 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 14:01:18,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:01:18,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2019-11-22 14:01:18,978 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:19,221 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 14:01:19,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:19,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2019-11-22 14:01:19,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:19,437 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-22 14:01:19,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:19,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2019-11-22 14:01:19,457 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:19,674 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 14:01:19,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:19,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2019-11-22 14:01:19,715 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:19,883 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 14:01:19,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:19,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-11-22 14:01:19,914 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:20,100 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 14:01:20,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:20,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2019-11-22 14:01:20,114 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:20,262 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-22 14:01:20,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:20,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 14:01:20,265 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:249, output treesize:129 [2019-11-22 14:01:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:20,393 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:20,656 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 14:01:20,764 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 14:01:20,933 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 14:01:21,041 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 14:01:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:21,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [75148606] [2019-11-22 14:01:21,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:21,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 14:01:21,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135329761] [2019-11-22 14:01:21,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 14:01:21,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:21,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 14:01:21,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:01:21,062 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand 9 states. [2019-11-22 14:01:21,423 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-11-22 14:01:21,840 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 91 [2019-11-22 14:01:22,404 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-22 14:01:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:24,017 INFO L93 Difference]: Finished difference Result 355 states and 474 transitions. [2019-11-22 14:01:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:01:24,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 14:01:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:24,024 INFO L225 Difference]: With dead ends: 355 [2019-11-22 14:01:24,025 INFO L226 Difference]: Without dead ends: 355 [2019-11-22 14:01:24,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 14:01:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-22 14:01:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 290. [2019-11-22 14:01:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-22 14:01:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 436 transitions. [2019-11-22 14:01:24,077 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 436 transitions. Word has length 11 [2019-11-22 14:01:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:24,078 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 436 transitions. [2019-11-22 14:01:24,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 14:01:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2019-11-22 14:01:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 14:01:24,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:24,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:24,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:24,284 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 14:01:24,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 14:01:24,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:24,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [11157213] [2019-11-22 14:01:24,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:24,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:01:24,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:25,011 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 14:01:25,011 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 14:01:25,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1568 treesize of output 1562 [2019-11-22 14:01:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:25,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:26,381 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 229 DAG size of output: 64 [2019-11-22 14:01:26,382 INFO L567 ElimStorePlain]: treesize reduction 58523, result has 0.2 percent of original size [2019-11-22 14:01:26,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:26,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:26,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 14:01:26,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:26,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:26,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:26,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:26,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:26,931 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 14:01:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:27,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:27,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [11157213] [2019-11-22 14:01:27,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:27,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 14:01:27,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968489710] [2019-11-22 14:01:27,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:01:27,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:01:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:01:27,427 INFO L87 Difference]: Start difference. First operand 290 states and 436 transitions. Second operand 10 states. [2019-11-22 14:01:28,526 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 14:01:29,332 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 14:01:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:30,314 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2019-11-22 14:01:30,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:01:30,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 14:01:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:30,320 INFO L225 Difference]: With dead ends: 373 [2019-11-22 14:01:30,321 INFO L226 Difference]: Without dead ends: 373 [2019-11-22 14:01:30,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:01:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-22 14:01:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 313. [2019-11-22 14:01:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-22 14:01:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 458 transitions. [2019-11-22 14:01:30,342 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 458 transitions. Word has length 12 [2019-11-22 14:01:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:30,342 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 458 transitions. [2019-11-22 14:01:30,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:01:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 458 transitions. [2019-11-22 14:01:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 14:01:30,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:30,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:30,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:30,548 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 14:01:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 14:01:30,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:30,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1918464889] [2019-11-22 14:01:30,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:31,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 14:01:31,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:31,066 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 14:01:31,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,143 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 14:01:31,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 14:01:31,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:31,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:31,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:31,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:31,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2019-11-22 14:01:31,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:31,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:31,496 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-22 14:01:31,497 INFO L567 ElimStorePlain]: treesize reduction 166, result has 27.2 percent of original size [2019-11-22 14:01:31,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:31,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 14:01:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:31,743 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:32,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1918464889] [2019-11-22 14:01:32,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:32,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 14:01:32,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764200518] [2019-11-22 14:01:32,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:01:32,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:01:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:01:32,057 INFO L87 Difference]: Start difference. First operand 313 states and 458 transitions. Second operand 8 states. [2019-11-22 14:01:32,243 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-22 14:01:36,026 WARN L192 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 14:01:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:37,101 INFO L93 Difference]: Finished difference Result 372 states and 471 transitions. [2019-11-22 14:01:37,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:01:37,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 14:01:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:37,104 INFO L225 Difference]: With dead ends: 372 [2019-11-22 14:01:37,104 INFO L226 Difference]: Without dead ends: 372 [2019-11-22 14:01:37,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:01:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-22 14:01:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2019-11-22 14:01:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-22 14:01:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 453 transitions. [2019-11-22 14:01:37,125 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 453 transitions. Word has length 13 [2019-11-22 14:01:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:37,125 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 453 transitions. [2019-11-22 14:01:37,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:01:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 453 transitions. [2019-11-22 14:01:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:01:37,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:37,127 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:37,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:37,329 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 14:01:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 14:01:37,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:37,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1287669151] [2019-11-22 14:01:37,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:37,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 14:01:37,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:37,860 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 15=[|v_#valid_93|]} [2019-11-22 14:01:37,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:37,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:01:38,144 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-22 14:01:38,145 INFO L343 Elim1Store]: treesize reduction 28, result has 81.1 percent of original size [2019-11-22 14:01:38,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 14:01:38,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:38,357 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-22 14:01:38,358 INFO L567 ElimStorePlain]: treesize reduction 62, result has 69.9 percent of original size [2019-11-22 14:01:38,459 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:38,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 402 [2019-11-22 14:01:38,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:38,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:39,760 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 248 DAG size of output: 64 [2019-11-22 14:01:39,761 INFO L567 ElimStorePlain]: treesize reduction 7690, result has 1.6 percent of original size [2019-11-22 14:01:39,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:39,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:109, output treesize:129 [2019-11-22 14:01:39,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:39,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,504 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-22 14:01:40,943 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 14:01:40,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:01:40,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2019-11-22 14:01:40,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:41,324 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-11-22 14:01:41,325 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.9 percent of original size [2019-11-22 14:01:41,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2019-11-22 14:01:41,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:41,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:41,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2019-11-22 14:01:41,454 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:41,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:41,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-22 14:01:41,561 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:41,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:41,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 14:01:41,648 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:195, output treesize:92 [2019-11-22 14:01:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:41,731 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:42,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1287669151] [2019-11-22 14:01:42,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:01:42,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-22 14:01:42,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120148405] [2019-11-22 14:01:42,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:01:42,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:42,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:01:42,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:01:42,182 INFO L87 Difference]: Start difference. First operand 314 states and 453 transitions. Second operand 10 states. [2019-11-22 14:01:42,544 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-22 14:01:43,084 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-22 14:01:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:45,681 INFO L93 Difference]: Finished difference Result 442 states and 590 transitions. [2019-11-22 14:01:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:01:45,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 14:01:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:45,690 INFO L225 Difference]: With dead ends: 442 [2019-11-22 14:01:45,690 INFO L226 Difference]: Without dead ends: 442 [2019-11-22 14:01:45,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-22 14:01:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-22 14:01:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 343. [2019-11-22 14:01:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 14:01:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 492 transitions. [2019-11-22 14:01:45,723 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 492 transitions. Word has length 19 [2019-11-22 14:01:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:45,723 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 492 transitions. [2019-11-22 14:01:45,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:01:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 492 transitions. [2019-11-22 14:01:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 14:01:45,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:45,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:45,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:45,931 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 14:01:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602239, now seen corresponding path program 1 times [2019-11-22 14:01:45,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:45,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1907397500] [2019-11-22 14:01:45,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:46,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 14:01:46,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:46,217 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:46,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1907397500] [2019-11-22 14:01:46,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:46,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 14:01:46,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889367547] [2019-11-22 14:01:46,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:01:46,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:46,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:01:46,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:46,230 INFO L87 Difference]: Start difference. First operand 343 states and 492 transitions. Second operand 3 states. [2019-11-22 14:01:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:46,252 INFO L93 Difference]: Finished difference Result 504 states and 738 transitions. [2019-11-22 14:01:46,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:01:46,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 14:01:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:46,258 INFO L225 Difference]: With dead ends: 504 [2019-11-22 14:01:46,258 INFO L226 Difference]: Without dead ends: 504 [2019-11-22 14:01:46,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-22 14:01:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 487. [2019-11-22 14:01:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-22 14:01:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 730 transitions. [2019-11-22 14:01:46,278 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 730 transitions. Word has length 23 [2019-11-22 14:01:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:46,278 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 730 transitions. [2019-11-22 14:01:46,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:01:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 730 transitions. [2019-11-22 14:01:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 14:01:46,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:46,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:46,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:46,488 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 14:01:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1646602463, now seen corresponding path program 1 times [2019-11-22 14:01:46,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:46,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [980514356] [2019-11-22 14:01:46,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:46,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 14:01:46,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:46,742 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:46,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980514356] [2019-11-22 14:01:46,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:46,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 14:01:46,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306941555] [2019-11-22 14:01:46,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:01:46,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:46,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:01:46,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:46,750 INFO L87 Difference]: Start difference. First operand 487 states and 730 transitions. Second operand 3 states. [2019-11-22 14:01:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:46,759 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-11-22 14:01:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:01:46,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 14:01:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:46,765 INFO L225 Difference]: With dead ends: 455 [2019-11-22 14:01:46,765 INFO L226 Difference]: Without dead ends: 455 [2019-11-22 14:01:46,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-22 14:01:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-22 14:01:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-22 14:01:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 676 transitions. [2019-11-22 14:01:46,788 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 676 transitions. Word has length 23 [2019-11-22 14:01:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:46,791 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 676 transitions. [2019-11-22 14:01:46,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:01:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 676 transitions. [2019-11-22 14:01:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 14:01:46,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:46,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:46,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:46,998 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 14:01:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash -494938069, now seen corresponding path program 1 times [2019-11-22 14:01:47,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:47,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1473429905] [2019-11-22 14:01:47,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:47,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 14:01:47,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:47,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:47,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1473429905] [2019-11-22 14:01:47,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:47,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 14:01:47,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594542865] [2019-11-22 14:01:47,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:01:47,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:01:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:01:47,288 INFO L87 Difference]: Start difference. First operand 455 states and 676 transitions. Second operand 4 states. [2019-11-22 14:01:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:47,441 INFO L93 Difference]: Finished difference Result 546 states and 773 transitions. [2019-11-22 14:01:47,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:01:47,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 14:01:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:47,448 INFO L225 Difference]: With dead ends: 546 [2019-11-22 14:01:47,449 INFO L226 Difference]: Without dead ends: 546 [2019-11-22 14:01:47,449 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 14:01:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-22 14:01:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 515. [2019-11-22 14:01:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-22 14:01:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 756 transitions. [2019-11-22 14:01:47,475 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 756 transitions. Word has length 24 [2019-11-22 14:01:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:47,476 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 756 transitions. [2019-11-22 14:01:47,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:01:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 756 transitions. [2019-11-22 14:01:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 14:01:47,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:47,485 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:47,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:47,688 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 14:01:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 14:01:47,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:47,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [567801669] [2019-11-22 14:01:47,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:48,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 14:01:48,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:48,173 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:48,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [567801669] [2019-11-22 14:01:48,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:01:48,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 14:01:48,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035068041] [2019-11-22 14:01:48,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:01:48,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:01:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:01:48,231 INFO L87 Difference]: Start difference. First operand 515 states and 756 transitions. Second operand 8 states. [2019-11-22 14:01:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:48,380 INFO L93 Difference]: Finished difference Result 535 states and 764 transitions. [2019-11-22 14:01:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:01:48,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 14:01:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:48,385 INFO L225 Difference]: With dead ends: 535 [2019-11-22 14:01:48,385 INFO L226 Difference]: Without dead ends: 535 [2019-11-22 14:01:48,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:01:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-11-22 14:01:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 462. [2019-11-22 14:01:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-22 14:01:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 634 transitions. [2019-11-22 14:01:48,406 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 634 transitions. Word has length 25 [2019-11-22 14:01:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:48,407 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 634 transitions. [2019-11-22 14:01:48,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:01:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 634 transitions. [2019-11-22 14:01:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 14:01:48,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:48,408 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:48,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:48,613 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 14:01:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:48,613 INFO L82 PathProgramCache]: Analyzing trace with hash -71787967, now seen corresponding path program 1 times [2019-11-22 14:01:48,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:48,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [325607748] [2019-11-22 14:01:48,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:48,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 14:01:48,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:01:48,890 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:48,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 14:01:48,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [325607748] [2019-11-22 14:01:48,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:01:48,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 14:01:48,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251392272] [2019-11-22 14:01:48,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:01:48,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:48,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:01:48,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:48,937 INFO L87 Difference]: Start difference. First operand 462 states and 634 transitions. Second operand 3 states. [2019-11-22 14:01:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:01:48,943 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2019-11-22 14:01:48,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:01:48,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 14:01:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:01:48,946 INFO L225 Difference]: With dead ends: 312 [2019-11-22 14:01:48,946 INFO L226 Difference]: Without dead ends: 312 [2019-11-22 14:01:48,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:01:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-22 14:01:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2019-11-22 14:01:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-22 14:01:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2019-11-22 14:01:48,956 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 33 [2019-11-22 14:01:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:01:48,956 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2019-11-22 14:01:48,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:01:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2019-11-22 14:01:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 14:01:48,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:01:48,958 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:01:49,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:49,161 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 14:01:49,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:01:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 14:01:49,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:01:49,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1825029064] [2019-11-22 14:01:49,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:01:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:01:49,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:01:49,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:01:49,948 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 14:01:49,949 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 14:01:49,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 14:01:49,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:50,090 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 14:01:50,091 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 14:01:50,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:50,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:01:50,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 14:01:50,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:50,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:50,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:50,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:50,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:50,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:50,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 60 treesize of output 136 [2019-11-22 14:01:50,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:50,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:50,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 14:01:50,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:50,948 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 14:01:50,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:50,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 136 [2019-11-22 14:01:50,952 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:50,960 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:50,960 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:50,967 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:50,967 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:50,973 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 14:01:50,973 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:51,098 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 14:01:51,098 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:51,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 58 treesize of output 134 [2019-11-22 14:01:51,100 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 14:01:51,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:01:51,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 14:01:51,172 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 14:01:51,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 14:01:51,352 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 14:01:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 14:01:51,427 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:01:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 14:01:51,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1825029064] [2019-11-22 14:01:51,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:01:51,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 14:01:51,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780290428] [2019-11-22 14:01:51,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 14:01:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 14:01:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 14:01:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:01:51,726 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand 14 states. [2019-11-22 14:01:54,737 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 14:02:00,306 WARN L192 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 14:02:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:02:01,985 INFO L93 Difference]: Finished difference Result 396 states and 499 transitions. [2019-11-22 14:02:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:02:01,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 14:02:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:02:01,992 INFO L225 Difference]: With dead ends: 396 [2019-11-22 14:02:01,992 INFO L226 Difference]: Without dead ends: 390 [2019-11-22 14:02:01,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 14:02:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-22 14:02:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 353. [2019-11-22 14:02:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-22 14:02:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 462 transitions. [2019-11-22 14:02:02,005 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 462 transitions. Word has length 33 [2019-11-22 14:02:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:02:02,006 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 462 transitions. [2019-11-22 14:02:02,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 14:02:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 462 transitions. [2019-11-22 14:02:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 14:02:02,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:02:02,009 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:02:02,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:02,210 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 14:02:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:02:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1447512898, now seen corresponding path program 1 times [2019-11-22 14:02:02,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:02:02,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [202239271] [2019-11-22 14:02:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:02:02,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 14:02:02,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:02:03,062 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 14:02:03,062 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 14:02:03,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-22 14:02:03,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:03,198 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 14:02:03,198 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 14:02:03,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:02:03,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 14:02:03,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-22 14:02:03,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:03,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:03,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:02:03,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 14:02:03,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:02:03,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 14:02:03,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:02:03,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:02:03,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:02:03,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 14:02:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:02:03,400 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:02:03,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:02:04,034 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 14:02:04,552 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-22 14:02:04,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:02:04,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:02:04,768 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 14:02:04,775 INFO L168 Benchmark]: Toolchain (without parser) took 61662.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.6 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:04,775 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:02:04,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:04,776 INFO L168 Benchmark]: Boogie Preprocessor took 80.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:04,777 INFO L168 Benchmark]: RCFGBuilder took 919.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:04,777 INFO L168 Benchmark]: TraceAbstraction took 59948.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -130.8 MB). Peak memory consumption was 139.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:02:04,779 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.24 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 708.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 919.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59948.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -130.8 MB). Peak memory consumption was 139.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...