java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:17:27,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:17:27,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:17:27,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:17:27,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:17:27,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:17:27,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:17:27,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:17:27,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:17:27,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:17:27,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:17:27,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:17:27,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:17:27,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:17:27,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:17:27,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:17:27,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:17:27,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:17:27,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:17:27,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:17:27,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:17:27,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:17:27,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:17:27,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:17:27,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:17:27,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:17:27,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:17:27,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:17:27,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:17:27,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:17:27,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:17:27,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:17:27,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:17:27,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:17:27,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:17:27,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:17:27,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:17:27,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:17:27,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:17:27,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:17:27,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:17:27,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:17:27,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:17:27,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:17:27,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:17:27,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:17:27,886 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:17:27,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:17:27,887 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:17:27,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:17:27,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:17:27,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:17:27,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:17:27,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:17:27,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:17:27,888 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:17:27,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:17:27,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:17:27,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:17:27,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:17:27,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:17:27,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:17:27,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:17:27,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:17:27,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:17:27,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:17:27,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:17:27,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:17:27,890 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:17:27,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:17:27,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:17:27,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:17:27,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:17:27,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:17:27,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:17:27,942 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:17:27,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i [2019-09-08 02:17:27,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8303dde5/edddfd5985814d09aa2a38ce7e15f60e/FLAGee04249b6 [2019-09-08 02:17:28,509 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:17:28,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i [2019-09-08 02:17:28,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8303dde5/edddfd5985814d09aa2a38ce7e15f60e/FLAGee04249b6 [2019-09-08 02:17:28,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8303dde5/edddfd5985814d09aa2a38ce7e15f60e [2019-09-08 02:17:28,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:17:28,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:17:28,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:17:28,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:17:28,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:17:28,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:17:28" (1/1) ... [2019-09-08 02:17:28,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c6119c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:28, skipping insertion in model container [2019-09-08 02:17:28,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:17:28" (1/1) ... [2019-09-08 02:17:28,839 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:17:28,894 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:17:29,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:17:29,353 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:17:29,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:17:29,468 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:17:29,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29 WrapperNode [2019-09-08 02:17:29,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:17:29,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:17:29,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:17:29,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:17:29,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (1/1) ... [2019-09-08 02:17:29,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (1/1) ... [2019-09-08 02:17:29,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (1/1) ... [2019-09-08 02:17:29,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (1/1) ... [2019-09-08 02:17:29,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (1/1) ... [2019-09-08 02:17:29,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (1/1) ... [2019-09-08 02:17:29,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (1/1) ... [2019-09-08 02:17:29,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:17:29,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:17:29,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:17:29,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:17:29,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (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-09-08 02:17:29,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:17:29,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:17:29,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 02:17:29,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 02:17:29,631 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-08 02:17:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-09-08 02:17:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-09-08 02:17:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-09-08 02:17:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2019-09-08 02:17:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2019-09-08 02:17:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:17:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:17:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:17:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 02:17:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 02:17:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 02:17:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 02:17:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 02:17:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 02:17:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 02:17:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 02:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 02:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 02:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 02:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 02:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 02:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 02:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 02:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 02:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 02:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 02:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 02:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 02:17:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 02:17:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 02:17:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 02:17:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 02:17:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 02:17:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 02:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 02:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 02:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 02:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 02:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 02:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 02:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 02:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 02:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 02:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 02:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 02:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 02:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 02:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 02:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 02:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 02:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 02:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 02:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 02:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 02:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 02:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 02:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 02:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 02:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 02:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 02:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 02:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 02:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 02:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 02:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 02:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 02:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 02:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 02:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 02:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 02:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 02:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 02:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 02:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 02:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 02:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 02:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 02:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 02:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 02:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 02:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 02:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 02:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 02:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 02:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 02:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 02:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 02:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 02:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 02:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 02:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 02:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 02:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 02:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 02:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 02:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 02:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 02:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 02:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 02:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 02:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 02:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 02:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 02:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 02:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 02:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 02:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 02:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 02:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 02:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 02:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 02:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 02:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 02:17:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-08 02:17:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-09-08 02:17:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 02:17:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 02:17:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-09-08 02:17:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 02:17:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-09-08 02:17:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:17:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2019-09-08 02:17:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2019-09-08 02:17:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:17:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:17:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 02:17:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:17:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:17:29,982 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-08 02:17:30,258 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:17:30,259 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-08 02:17:30,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:17:30 BoogieIcfgContainer [2019-09-08 02:17:30,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:17:30,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:17:30,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:17:30,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:17:30,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:17:28" (1/3) ... [2019-09-08 02:17:30,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7753a43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:17:30, skipping insertion in model container [2019-09-08 02:17:30,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:17:29" (2/3) ... [2019-09-08 02:17:30,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7753a43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:17:30, skipping insertion in model container [2019-09-08 02:17:30,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:17:30" (3/3) ... [2019-09-08 02:17:30,270 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-2.i [2019-09-08 02:17:30,283 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:17:30,293 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:17:30,308 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:17:30,331 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:17:30,331 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:17:30,332 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:17:30,332 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:17:30,332 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:17:30,332 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:17:30,332 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:17:30,332 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:17:30,333 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:17:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-09-08 02:17:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:17:30,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:17:30,360 INFO L399 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-09-08 02:17:30,362 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:17:30,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:17:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -87837704, now seen corresponding path program 1 times [2019-09-08 02:17:30,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:17:30,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:17:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:30,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:17:30,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:17:30,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:17:30,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:17:30,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:17:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:30,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 02:17:30,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:17:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:17:30,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:17:30,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2019-09-08 02:17:30,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:17:30,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:17:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:17:30,652 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-09-08 02:17:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:17:30,684 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2019-09-08 02:17:30,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:17:30,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2019-09-08 02:17:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:17:30,695 INFO L225 Difference]: With dead ends: 124 [2019-09-08 02:17:30,695 INFO L226 Difference]: Without dead ends: 51 [2019-09-08 02:17:30,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:17:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-08 02:17:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-08 02:17:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 02:17:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-09-08 02:17:30,774 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 37 [2019-09-08 02:17:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:17:30,775 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-09-08 02:17:30,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:17:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-09-08 02:17:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 02:17:30,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:17:30,780 INFO L399 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, 1, 1, 1] [2019-09-08 02:17:30,780 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:17:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:17:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1536900415, now seen corresponding path program 1 times [2019-09-08 02:17:30,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:17:30,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:17:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:30,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:17:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:17:31,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:17:31,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:17:31,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:17:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:31,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:17:31,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:17:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:17:31,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:17:31,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2019-09-08 02:17:31,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:17:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:17:31,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:17:31,115 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 9 states. [2019-09-08 02:17:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:17:31,259 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2019-09-08 02:17:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:17:31,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-09-08 02:17:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:17:31,262 INFO L225 Difference]: With dead ends: 91 [2019-09-08 02:17:31,262 INFO L226 Difference]: Without dead ends: 53 [2019-09-08 02:17:31,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:17:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-08 02:17:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-08 02:17:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 02:17:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-09-08 02:17:31,272 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 42 [2019-09-08 02:17:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:17:31,274 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-09-08 02:17:31,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:17:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-09-08 02:17:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 02:17:31,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:17:31,276 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-08 02:17:31,276 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:17:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:17:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1663200358, now seen corresponding path program 1 times [2019-09-08 02:17:31,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:17:31,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:17:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:17:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 02:17:31,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:17:31,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 02:17:31,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:17:31,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:17:31,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:17:31,429 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 10 states. [2019-09-08 02:17:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:17:31,611 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-09-08 02:17:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:17:31,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-09-08 02:17:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:17:31,615 INFO L225 Difference]: With dead ends: 73 [2019-09-08 02:17:31,615 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 02:17:31,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:17:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 02:17:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-09-08 02:17:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 02:17:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-09-08 02:17:31,640 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 46 [2019-09-08 02:17:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:17:31,641 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-09-08 02:17:31,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:17:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-09-08 02:17:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 02:17:31,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:17:31,646 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-09-08 02:17:31,647 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:17:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:17:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1968577046, now seen corresponding path program 1 times [2019-09-08 02:17:31,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:17:31,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:17:31,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:31,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:17:31,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:17:31,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:17:31,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:17:31,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:17:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:31,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:17:31,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:17:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 02:17:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:17:31,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 02:17:31,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:17:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:17:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:17:31,920 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 10 states. [2019-09-08 02:17:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:17:32,073 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2019-09-08 02:17:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:17:32,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-09-08 02:17:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:17:32,079 INFO L225 Difference]: With dead ends: 109 [2019-09-08 02:17:32,080 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 02:17:32,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:17:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 02:17:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-08 02:17:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-08 02:17:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-09-08 02:17:32,101 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 47 [2019-09-08 02:17:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:17:32,102 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-09-08 02:17:32,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:17:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-09-08 02:17:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:17:32,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:17:32,104 INFO L399 BasicCegarLoop]: trace histogram [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-09-08 02:17:32,104 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:17:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:17:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1781197021, now seen corresponding path program 2 times [2019-09-08 02:17:32,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:17:32,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:17:32,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:32,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:17:32,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:17:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 02:17:32,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:17:32,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:17:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:17:32,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:17:32,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:17:32,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:17:32,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:17:32,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:17:32,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:17:32,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:17:32,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:17:32,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-09-08 02:17:33,535 INFO L375 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 24 treesize of output 16 [2019-09-08 02:17:33,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:17:33,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:17:33,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:17:33,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-09-08 02:17:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:17:33,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:17:33,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2019-09-08 02:17:33,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:17:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:17:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:17:33,867 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 18 states. [2019-09-08 02:17:43,266 WARN L188 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-08 02:17:43,485 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-09-08 02:17:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:17:59,869 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-09-08 02:17:59,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:17:59,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2019-09-08 02:17:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:17:59,872 INFO L225 Difference]: With dead ends: 115 [2019-09-08 02:17:59,872 INFO L226 Difference]: Without dead ends: 105 [2019-09-08 02:17:59,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:17:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-08 02:17:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-09-08 02:17:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 02:17:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-09-08 02:17:59,886 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 51 [2019-09-08 02:17:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:17:59,886 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-09-08 02:17:59,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:17:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-09-08 02:17:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 02:17:59,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:17:59,888 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:17:59,888 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:17:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:17:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1370713395, now seen corresponding path program 3 times [2019-09-08 02:17:59,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:17:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:17:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:59,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:17:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:17:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 02:18:00,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:00,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:00,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:18:00,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 02:18:00,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:00,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 02:18:00,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 02:18:00,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:00,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:18:00,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:18:00,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:18:00,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:18:00,333 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 14 states. [2019-09-08 02:18:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:00,678 INFO L93 Difference]: Finished difference Result 143 states and 191 transitions. [2019-09-08 02:18:00,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:18:00,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-09-08 02:18:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:00,686 INFO L225 Difference]: With dead ends: 143 [2019-09-08 02:18:00,686 INFO L226 Difference]: Without dead ends: 139 [2019-09-08 02:18:00,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:18:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-08 02:18:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2019-09-08 02:18:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 02:18:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2019-09-08 02:18:00,732 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 52 [2019-09-08 02:18:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:00,734 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2019-09-08 02:18:00,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:18:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2019-09-08 02:18:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 02:18:00,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:00,740 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 02:18:00,740 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1530622877, now seen corresponding path program 4 times [2019-09-08 02:18:00,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:00,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:00,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 02:18:01,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:01,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:01,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:18:01,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:18:01,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:01,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 02:18:01,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:01,133 INFO L375 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-09-08 02:18:01,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:01,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-08 02:18:01,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:01,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:01,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:01,182 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:01,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-09-08 02:18:01,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:01,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 02:18:01,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:01,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-09-08 02:18:01,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:01,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:01,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:01,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:01,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:01,278 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2019-09-08 02:18:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:18:02,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:02,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2019-09-08 02:18:02,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:18:02,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:18:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:18:02,963 INFO L87 Difference]: Start difference. First operand 113 states and 147 transitions. Second operand 26 states. [2019-09-08 02:18:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:04,515 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2019-09-08 02:18:04,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:18:04,516 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 53 [2019-09-08 02:18:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:04,518 INFO L225 Difference]: With dead ends: 184 [2019-09-08 02:18:04,521 INFO L226 Difference]: Without dead ends: 174 [2019-09-08 02:18:04,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:18:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-08 02:18:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2019-09-08 02:18:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-08 02:18:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 199 transitions. [2019-09-08 02:18:04,564 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 199 transitions. Word has length 53 [2019-09-08 02:18:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:04,565 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 199 transitions. [2019-09-08 02:18:04,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:18:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 199 transitions. [2019-09-08 02:18:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 02:18:04,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:04,567 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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-09-08 02:18:04,567 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash -407513290, now seen corresponding path program 1 times [2019-09-08 02:18:04,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:04,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:04,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:04,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:18:04,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:04,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:18:04,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:04,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:18:04,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:04,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:18:04,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:04,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-09-08 02:18:04,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:18:04,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:18:04,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:18:04,905 INFO L87 Difference]: Start difference. First operand 152 states and 199 transitions. Second operand 14 states. [2019-09-08 02:18:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:05,273 INFO L93 Difference]: Finished difference Result 299 states and 402 transitions. [2019-09-08 02:18:05,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:18:05,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-09-08 02:18:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:05,277 INFO L225 Difference]: With dead ends: 299 [2019-09-08 02:18:05,277 INFO L226 Difference]: Without dead ends: 201 [2019-09-08 02:18:05,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:18:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-08 02:18:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 176. [2019-09-08 02:18:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-08 02:18:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 236 transitions. [2019-09-08 02:18:05,302 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 236 transitions. Word has length 55 [2019-09-08 02:18:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:05,303 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 236 transitions. [2019-09-08 02:18:05,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:18:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 236 transitions. [2019-09-08 02:18:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 02:18:05,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:05,304 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 02:18:05,305 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2096457032, now seen corresponding path program 1 times [2019-09-08 02:18:05,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:05,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:05,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:05,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:18:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:18:05,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:05,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:18:05,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:05,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:18:05,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:18:05,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:18:05,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2019-09-08 02:18:05,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:18:05,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:18:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:18:05,484 INFO L87 Difference]: Start difference. First operand 176 states and 236 transitions. Second operand 11 states. [2019-09-08 02:18:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:05,735 INFO L93 Difference]: Finished difference Result 219 states and 293 transitions. [2019-09-08 02:18:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:18:05,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-09-08 02:18:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:05,740 INFO L225 Difference]: With dead ends: 219 [2019-09-08 02:18:05,740 INFO L226 Difference]: Without dead ends: 193 [2019-09-08 02:18:05,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:18:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-08 02:18:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-08 02:18:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-08 02:18:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2019-09-08 02:18:05,760 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 55 [2019-09-08 02:18:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:05,760 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2019-09-08 02:18:05,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:18:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2019-09-08 02:18:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 02:18:05,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:05,762 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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-09-08 02:18:05,762 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash -936081888, now seen corresponding path program 2 times [2019-09-08 02:18:05,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:05,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:05,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:05,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:18:05,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:18:05,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:05,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:05,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:18:05,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:18:05,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:05,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:18:05,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:18:05,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:05,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 02:18:05,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:18:05,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:18:05,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:18:05,915 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand 12 states. [2019-09-08 02:18:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:06,124 INFO L93 Difference]: Finished difference Result 268 states and 358 transitions. [2019-09-08 02:18:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:18:06,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-08 02:18:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:06,134 INFO L225 Difference]: With dead ends: 268 [2019-09-08 02:18:06,134 INFO L226 Difference]: Without dead ends: 185 [2019-09-08 02:18:06,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:18:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-08 02:18:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 167. [2019-09-08 02:18:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-08 02:18:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 222 transitions. [2019-09-08 02:18:06,171 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 222 transitions. Word has length 55 [2019-09-08 02:18:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:06,172 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 222 transitions. [2019-09-08 02:18:06,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:18:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 222 transitions. [2019-09-08 02:18:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 02:18:06,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:06,175 INFO L399 BasicCegarLoop]: trace histogram [4, 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-09-08 02:18:06,175 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1011494620, now seen corresponding path program 5 times [2019-09-08 02:18:06,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:06,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 02:18:06,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:06,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:18:06,418 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 02:18:06,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:06,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:18:06,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 02:18:06,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:06,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 02:18:06,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:18:06,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:18:06,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:18:06,447 INFO L87 Difference]: Start difference. First operand 167 states and 222 transitions. Second operand 11 states. [2019-09-08 02:18:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:06,672 INFO L93 Difference]: Finished difference Result 270 states and 357 transitions. [2019-09-08 02:18:06,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:18:06,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-09-08 02:18:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:06,675 INFO L225 Difference]: With dead ends: 270 [2019-09-08 02:18:06,675 INFO L226 Difference]: Without dead ends: 175 [2019-09-08 02:18:06,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:18:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-08 02:18:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 149. [2019-09-08 02:18:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-08 02:18:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2019-09-08 02:18:06,695 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 57 [2019-09-08 02:18:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:06,695 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2019-09-08 02:18:06,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:18:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2019-09-08 02:18:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 02:18:06,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:06,697 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1] [2019-09-08 02:18:06,697 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 402935559, now seen corresponding path program 3 times [2019-09-08 02:18:06,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:06,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:06,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 02:18:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:06,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:06,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:18:06,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 02:18:06,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:06,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 02:18:06,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:07,004 INFO L375 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-09-08 02:18:07,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:07,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-09-08 02:18:07,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:18:07,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:07,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-08 02:18:07,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:07,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 02:18:07,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:07,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-09-08 02:18:07,145 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_24|], 1=[|v_#memory_$Pointer$.base_26|]} [2019-09-08 02:18:07,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:18:07,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:07,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 19 [2019-09-08 02:18:07,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:07,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:07,185 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-09-08 02:18:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:18:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2019-09-08 02:18:07,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:18:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:18:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:18:07,737 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand 29 states. [2019-09-08 02:18:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:09,162 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-09-08 02:18:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:18:09,163 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2019-09-08 02:18:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:09,165 INFO L225 Difference]: With dead ends: 185 [2019-09-08 02:18:09,165 INFO L226 Difference]: Without dead ends: 178 [2019-09-08 02:18:09,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:18:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-08 02:18:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 150. [2019-09-08 02:18:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-08 02:18:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 192 transitions. [2019-09-08 02:18:09,178 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 192 transitions. Word has length 59 [2019-09-08 02:18:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:09,179 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 192 transitions. [2019-09-08 02:18:09,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:18:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 192 transitions. [2019-09-08 02:18:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 02:18:09,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:09,180 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1] [2019-09-08 02:18:09,180 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1912887145, now seen corresponding path program 4 times [2019-09-08 02:18:09,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:09,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:09,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:09,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:09,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:18:09,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:09,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:18:09,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:09,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:18:09,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:09,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:18:09,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:18:09,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:09,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 24 [2019-09-08 02:18:09,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:18:09,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:18:09,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:18:09,796 INFO L87 Difference]: Start difference. First operand 150 states and 192 transitions. Second operand 24 states. [2019-09-08 02:18:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:10,882 INFO L93 Difference]: Finished difference Result 253 states and 347 transitions. [2019-09-08 02:18:10,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:18:10,883 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2019-09-08 02:18:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:10,885 INFO L225 Difference]: With dead ends: 253 [2019-09-08 02:18:10,885 INFO L226 Difference]: Without dead ends: 246 [2019-09-08 02:18:10,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:18:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-08 02:18:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 203. [2019-09-08 02:18:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 02:18:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 269 transitions. [2019-09-08 02:18:10,914 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 269 transitions. Word has length 60 [2019-09-08 02:18:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:10,914 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 269 transitions. [2019-09-08 02:18:10,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:18:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 269 transitions. [2019-09-08 02:18:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 02:18:10,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:10,917 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1] [2019-09-08 02:18:10,917 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1476746055, now seen corresponding path program 5 times [2019-09-08 02:18:10,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:10,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:10,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 02:18:11,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:11,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:11,628 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:18:11,671 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 02:18:11,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:11,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 02:18:11,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:11,683 INFO L375 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-09-08 02:18:11,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:18:11,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:11,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:11,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-09-08 02:18:11,745 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 02:18:11,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,778 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-09-08 02:18:11,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-09-08 02:18:11,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:11,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:11,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-09-08 02:18:11,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,941 INFO L375 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 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-08 02:18:11,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:11,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:11,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:60 [2019-09-08 02:18:12,040 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:12,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 67 [2019-09-08 02:18:12,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:12,094 INFO L567 ElimStorePlain]: treesize reduction 48, result has 59.7 percent of original size [2019-09-08 02:18:12,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:18:12,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2019-09-08 02:18:12,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:12,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:12,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:12,120 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:84 [2019-09-08 02:18:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:18:13,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:13,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2019-09-08 02:18:13,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:18:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:18:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:18:13,260 INFO L87 Difference]: Start difference. First operand 203 states and 269 transitions. Second operand 34 states. [2019-09-08 02:18:14,232 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-08 02:18:15,365 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-09-08 02:18:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:16,103 INFO L93 Difference]: Finished difference Result 285 states and 373 transitions. [2019-09-08 02:18:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:18:16,110 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 61 [2019-09-08 02:18:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:16,111 INFO L225 Difference]: With dead ends: 285 [2019-09-08 02:18:16,112 INFO L226 Difference]: Without dead ends: 275 [2019-09-08 02:18:16,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:18:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-08 02:18:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243. [2019-09-08 02:18:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-08 02:18:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 320 transitions. [2019-09-08 02:18:16,138 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 320 transitions. Word has length 61 [2019-09-08 02:18:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:16,138 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 320 transitions. [2019-09-08 02:18:16,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:18:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 320 transitions. [2019-09-08 02:18:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 02:18:16,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:16,140 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1] [2019-09-08 02:18:16,140 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash 841274153, now seen corresponding path program 6 times [2019-09-08 02:18:16,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:16,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:16,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:16,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:16,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 02:18:16,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:16,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:18:16,822 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 02:18:16,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:16,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 02:18:16,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:16,833 INFO L375 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-09-08 02:18:16,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:16,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:16,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:16,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:18:16,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:16,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:16,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:16,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:16,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:16,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:16,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:16,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-09-08 02:18:16,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:16,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 02:18:16,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:16,957 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-09-08 02:18:16,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:16,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-09-08 02:18:17,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:17,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:17,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:17,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:17,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-09-08 02:18:17,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:17,140 INFO L375 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 20 treesize of output 30 [2019-09-08 02:18:17,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:17,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2019-09-08 02:18:17,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:17,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 75 [2019-09-08 02:18:17,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,279 INFO L567 ElimStorePlain]: treesize reduction 52, result has 56.7 percent of original size [2019-09-08 02:18:17,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-09-08 02:18:17,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:17,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:17,301 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:85 [2019-09-08 02:18:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:18:19,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:19,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2019-09-08 02:18:19,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:18:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:18:19,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1036, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:18:19,014 INFO L87 Difference]: Start difference. First operand 243 states and 320 transitions. Second operand 34 states. [2019-09-08 02:18:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:22,820 INFO L93 Difference]: Finished difference Result 287 states and 381 transitions. [2019-09-08 02:18:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:18:22,821 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-09-08 02:18:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:22,823 INFO L225 Difference]: With dead ends: 287 [2019-09-08 02:18:22,823 INFO L226 Difference]: Without dead ends: 267 [2019-09-08 02:18:22,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:18:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-08 02:18:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 231. [2019-09-08 02:18:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-08 02:18:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 306 transitions. [2019-09-08 02:18:22,845 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 306 transitions. Word has length 62 [2019-09-08 02:18:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:22,845 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 306 transitions. [2019-09-08 02:18:22,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:18:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 306 transitions. [2019-09-08 02:18:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 02:18:22,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:22,847 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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, 1, 1] [2019-09-08 02:18:22,847 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash -358704402, now seen corresponding path program 7 times [2019-09-08 02:18:22,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:22,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 02:18:23,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:23,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:23,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:18:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:23,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 02:18:23,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 02:18:23,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:23,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 02:18:23,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:18:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:18:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:18:23,079 INFO L87 Difference]: Start difference. First operand 231 states and 306 transitions. Second operand 13 states. [2019-09-08 02:18:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:23,296 INFO L93 Difference]: Finished difference Result 371 states and 510 transitions. [2019-09-08 02:18:23,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:18:23,301 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-09-08 02:18:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:23,303 INFO L225 Difference]: With dead ends: 371 [2019-09-08 02:18:23,303 INFO L226 Difference]: Without dead ends: 264 [2019-09-08 02:18:23,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:18:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-08 02:18:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 213. [2019-09-08 02:18:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-08 02:18:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 279 transitions. [2019-09-08 02:18:23,323 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 279 transitions. Word has length 65 [2019-09-08 02:18:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:23,324 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 279 transitions. [2019-09-08 02:18:23,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:18:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 279 transitions. [2019-09-08 02:18:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 02:18:23,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:23,325 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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-09-08 02:18:23,326 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1441819211, now seen corresponding path program 8 times [2019-09-08 02:18:23,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:23,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:23,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:23,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:18:23,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:18:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:23,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:23,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:18:23,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:18:23,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:23,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 02:18:23,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:23,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:18:23,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:23,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2019-09-08 02:18:23,784 INFO L375 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-09-08 02:18:23,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:23,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-09-08 02:18:23,866 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_31|], 1=[|v_#memory_$Pointer$.base_34|]} [2019-09-08 02:18:23,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:23,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:23,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:23,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 35 [2019-09-08 02:18:23,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:23,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,925 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-08 02:18:23,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:36 [2019-09-08 02:18:23,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:23,973 INFO L375 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 31 treesize of output 35 [2019-09-08 02:18:23,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:23,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:23,986 INFO L375 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 36 treesize of output 40 [2019-09-08 02:18:23,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:24,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:24,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-09-08 02:18:24,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:56 [2019-09-08 02:18:24,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:24,075 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, v_prenex_18, v_prenex_17], 5=[|v_#memory_$Pointer$.base_35|]} [2019-09-08 02:18:24,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 48 [2019-09-08 02:18:24,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:24,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:24,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 43 [2019-09-08 02:18:24,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:24,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:24,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 39 [2019-09-08 02:18:24,179 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:24,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:24,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:24,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 74 [2019-09-08 02:18:24,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:24,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:24,236 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:24,310 INFO L567 ElimStorePlain]: treesize reduction 63, result has 57.7 percent of original size [2019-09-08 02:18:24,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-08 02:18:24,311 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:94, output treesize:104 [2019-09-08 02:18:24,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:24,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:24,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:25,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:25,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:25,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:25,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:25,596 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-08 02:18:25,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:18:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 02:18:26,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:26,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2019-09-08 02:18:26,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:18:26,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:18:26,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:18:26,105 INFO L87 Difference]: Start difference. First operand 213 states and 279 transitions. Second operand 36 states. [2019-09-08 02:18:27,158 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-08 02:18:27,352 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-09-08 02:18:27,586 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2019-09-08 02:18:27,849 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2019-09-08 02:18:28,159 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 113 [2019-09-08 02:18:29,709 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 122 [2019-09-08 02:18:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:30,153 INFO L93 Difference]: Finished difference Result 249 states and 321 transitions. [2019-09-08 02:18:30,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:18:30,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2019-09-08 02:18:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:30,159 INFO L225 Difference]: With dead ends: 249 [2019-09-08 02:18:30,159 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 02:18:30,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=369, Invalid=2601, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:18:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 02:18:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 214. [2019-09-08 02:18:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 02:18:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 280 transitions. [2019-09-08 02:18:30,183 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 280 transitions. Word has length 67 [2019-09-08 02:18:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:30,183 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 280 transitions. [2019-09-08 02:18:30,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:18:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 280 transitions. [2019-09-08 02:18:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 02:18:30,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:30,185 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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-09-08 02:18:30,185 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:30,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash 560064123, now seen corresponding path program 9 times [2019-09-08 02:18:30,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:30,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:18:30,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:30,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:18:30,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:30,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:18:30,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:30,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 02:18:30,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 02:18:30,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:18:30,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 25 [2019-09-08 02:18:30,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:18:30,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:18:30,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:18:30,763 INFO L87 Difference]: Start difference. First operand 214 states and 280 transitions. Second operand 25 states. [2019-09-08 02:18:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:31,789 INFO L93 Difference]: Finished difference Result 358 states and 563 transitions. [2019-09-08 02:18:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:18:31,789 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2019-09-08 02:18:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:31,793 INFO L225 Difference]: With dead ends: 358 [2019-09-08 02:18:31,793 INFO L226 Difference]: Without dead ends: 354 [2019-09-08 02:18:31,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:18:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-08 02:18:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 256. [2019-09-08 02:18:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-08 02:18:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2019-09-08 02:18:31,829 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 68 [2019-09-08 02:18:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:31,830 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2019-09-08 02:18:31,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:18:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2019-09-08 02:18:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 02:18:31,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:31,832 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:18:31,832 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1673881246, now seen corresponding path program 1 times [2019-09-08 02:18:31,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:31,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:31,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:18:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 02:18:31,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:18:31,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:18:31,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:18:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:18:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:18:31,866 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand 3 states. [2019-09-08 02:18:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:31,891 INFO L93 Difference]: Finished difference Result 358 states and 527 transitions. [2019-09-08 02:18:31,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:18:31,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 02:18:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:31,894 INFO L225 Difference]: With dead ends: 358 [2019-09-08 02:18:31,894 INFO L226 Difference]: Without dead ends: 262 [2019-09-08 02:18:31,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 02:18:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-08 02:18:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-08 02:18:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-08 02:18:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 365 transitions. [2019-09-08 02:18:31,920 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 365 transitions. Word has length 71 [2019-09-08 02:18:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:31,920 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 365 transitions. [2019-09-08 02:18:31,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:18:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 365 transitions. [2019-09-08 02:18:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 02:18:31,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:31,922 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:18:31,922 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:31,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1341222372, now seen corresponding path program 1 times [2019-09-08 02:18:31,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:31,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:31,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:31,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:18:31,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 02:18:32,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:18:32,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 02:18:32,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:18:32,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:18:32,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:18:32,001 INFO L87 Difference]: Start difference. First operand 260 states and 365 transitions. Second operand 9 states. [2019-09-08 02:18:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:18:32,164 INFO L93 Difference]: Finished difference Result 317 states and 485 transitions. [2019-09-08 02:18:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:18:32,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 02:18:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:18:32,167 INFO L225 Difference]: With dead ends: 317 [2019-09-08 02:18:32,167 INFO L226 Difference]: Without dead ends: 313 [2019-09-08 02:18:32,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:18:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-08 02:18:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 285. [2019-09-08 02:18:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-08 02:18:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 418 transitions. [2019-09-08 02:18:32,200 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 418 transitions. Word has length 71 [2019-09-08 02:18:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:18:32,201 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 418 transitions. [2019-09-08 02:18:32,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:18:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 418 transitions. [2019-09-08 02:18:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 02:18:32,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:18:32,204 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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-09-08 02:18:32,204 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:18:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:18:32,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1806061963, now seen corresponding path program 10 times [2019-09-08 02:18:32,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:18:32,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:18:32,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:32,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:18:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:18:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:18:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:18:33,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:18:33,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:18:33,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:18:33,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:18:33,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:18:33,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 02:18:33,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:18:33,839 INFO L375 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-09-08 02:18:33,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:33,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:33,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:33,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:18:33,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:33,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:33,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:33,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:18:33,898 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:33,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:33,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:33,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-09-08 02:18:33,958 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:33,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 02:18:33,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:33,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:33,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:33,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-09-08 02:18:34,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:34,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:34,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:34,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:18:34,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:34,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:34,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:18:34,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-09-08 02:18:34,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:34,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 79 [2019-09-08 02:18:34,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,185 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:18:34,241 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.0 percent of original size [2019-09-08 02:18:34,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:34,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-09-08 02:18:34,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:34,326 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.4 percent of original size [2019-09-08 02:18:34,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:18:34,328 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:67 [2019-09-08 02:18:34,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,629 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 02:18:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:18:34,637 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_32, v_prenex_30, v_prenex_35, v_prenex_33], 9=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_36|]} [2019-09-08 02:18:34,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:34,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 113 [2019-09-08 02:18:34,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:34,931 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-08 02:18:34,931 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.8 percent of original size [2019-09-08 02:18:34,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:34,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 100 [2019-09-08 02:18:34,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:34,977 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:18:35,208 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-09-08 02:18:35,209 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.8 percent of original size [2019-09-08 02:18:35,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:35,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 116 [2019-09-08 02:18:35,253 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:35,472 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-09-08 02:18:35,473 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.3 percent of original size [2019-09-08 02:18:35,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:35,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 100 [2019-09-08 02:18:35,508 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:35,702 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-08 02:18:35,703 INFO L567 ElimStorePlain]: treesize reduction 36, result has 85.4 percent of original size [2019-09-08 02:18:35,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:35,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 153 [2019-09-08 02:18:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:35,804 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:18:36,048 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-09-08 02:18:36,048 INFO L567 ElimStorePlain]: treesize reduction 48, result has 81.6 percent of original size [2019-09-08 02:18:36,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:18:36,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 157 [2019-09-08 02:18:36,106 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:18:36,324 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-09-08 02:18:36,324 INFO L567 ElimStorePlain]: treesize reduction 48, result has 81.3 percent of original size [2019-09-08 02:18:36,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-09-08 02:18:36,330 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:232, output treesize:244 [2019-09-08 02:18:36,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:36,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:37,432 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 66 [2019-09-08 02:18:37,652 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-08 02:18:37,921 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-08 02:18:38,319 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 153 [2019-09-08 02:18:38,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-08 02:18:39,064 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-09-08 02:18:39,820 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-09-08 02:18:39,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:18:40,273 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-09-08 02:18:40,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:40,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:18:40,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:18:42,438 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 330 [2019-09-08 02:18:42,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:18:42,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-08 02:18:42,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-08 02:18:45,181 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 646 [2019-09-08 02:18:45,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-09-08 02:18:48,500 WARN L188 SmtUtils]: Spent 2.70 s on a formula simplification that was a NOOP. DAG size: 650 [2019-09-08 02:18:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-09-08 02:18:56,854 WARN L188 SmtUtils]: Spent 7.67 s on a formula simplification that was a NOOP. DAG size: 674 [2019-09-08 02:19:06,883 WARN L188 SmtUtils]: Spent 8.95 s on a formula simplification that was a NOOP. DAG size: 1269 [2019-09-08 02:19:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 47 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 02:19:07,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:19:07,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2019-09-08 02:19:07,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 02:19:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 02:19:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1617, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:19:07,252 INFO L87 Difference]: Start difference. First operand 285 states and 418 transitions. Second operand 42 states. [2019-09-08 02:19:07,941 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-09-08 02:19:08,564 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 77 [2019-09-08 02:19:08,966 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2019-09-08 02:19:09,532 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2019-09-08 02:19:09,832 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-08 02:19:11,014 WARN L188 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 185 [2019-09-08 02:19:12,577 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-08 02:19:13,419 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 02:19:13,803 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-08 02:19:14,847 WARN L188 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-09-08 02:19:33,494 WARN L188 SmtUtils]: Spent 17.43 s on a formula simplification. DAG size of input: 1313 DAG size of output: 1272 [2019-09-08 02:19:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:19:36,239 INFO L93 Difference]: Finished difference Result 372 states and 549 transitions. [2019-09-08 02:19:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:19:36,240 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 69 [2019-09-08 02:19:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:19:36,243 INFO L225 Difference]: With dead ends: 372 [2019-09-08 02:19:36,243 INFO L226 Difference]: Without dead ends: 365 [2019-09-08 02:19:36,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=193, Invalid=2887, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:19:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-08 02:19:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 335. [2019-09-08 02:19:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-08 02:19:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 485 transitions. [2019-09-08 02:19:36,289 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 485 transitions. Word has length 69 [2019-09-08 02:19:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:19:36,289 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 485 transitions. [2019-09-08 02:19:36,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 02:19:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 485 transitions. [2019-09-08 02:19:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:19:36,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:19:36,292 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:19:36,292 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:19:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:19:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash 935007276, now seen corresponding path program 1 times [2019-09-08 02:19:36,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:19:36,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:19:36,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:19:36,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:19:36,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:19:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:19:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:19:36,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:19:36,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:19:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:19:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:19:36,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 02:19:36,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:19:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 02:19:36,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:19:36,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2019-09-08 02:19:36,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:19:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:19:36,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:19:36,663 INFO L87 Difference]: Start difference. First operand 335 states and 485 transitions. Second operand 17 states. [2019-09-08 02:19:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:19:37,117 INFO L93 Difference]: Finished difference Result 517 states and 733 transitions. [2019-09-08 02:19:37,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:19:37,118 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-09-08 02:19:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:19:37,120 INFO L225 Difference]: With dead ends: 517 [2019-09-08 02:19:37,120 INFO L226 Difference]: Without dead ends: 320 [2019-09-08 02:19:37,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:19:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-08 02:19:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 261. [2019-09-08 02:19:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-08 02:19:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 326 transitions. [2019-09-08 02:19:37,165 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 326 transitions. Word has length 72 [2019-09-08 02:19:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:19:37,166 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 326 transitions. [2019-09-08 02:19:37,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:19:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 326 transitions. [2019-09-08 02:19:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 02:19:37,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:19:37,169 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 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-09-08 02:19:37,169 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:19:37,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:19:37,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2141526597, now seen corresponding path program 11 times [2019-09-08 02:19:37,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:19:37,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:19:37,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:19:37,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:19:37,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:19:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:19:37,825 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 02:19:37,999 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 02:19:38,193 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 02:19:38,384 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 02:19:38,588 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 02:19:38,783 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 02:19:39,277 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 02:19:39,498 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 02:19:39,725 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 02:19:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:19:39,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:19:39,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:19:39,773 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:19:39,838 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:19:39,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:19:39,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-08 02:19:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:19:39,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:19:39,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:39,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:39,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:19:39,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:39,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:39,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:19:39,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-09-08 02:19:39,971 INFO L375 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-09-08 02:19:39,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:39,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:39,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:19:39,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2019-09-08 02:19:40,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-09-08 02:19:40,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,180 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-09-08 02:19:40,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-09-08 02:19:40,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,232 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-09-08 02:19:40,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2019-09-08 02:19:40,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 74 [2019-09-08 02:19:40,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,352 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 78 [2019-09-08 02:19:40,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,459 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-08 02:19:40,460 INFO L567 ElimStorePlain]: treesize reduction 35, result has 73.7 percent of original size [2019-09-08 02:19:40,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-09-08 02:19:40,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:109, output treesize:98 [2019-09-08 02:19:40,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:40,564 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_143, v_prenex_144], 5=[|v_#memory_$Pointer$.offset_39|, |v_#memory_$Pointer$.base_42|]} [2019-09-08 02:19:40,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 61 [2019-09-08 02:19:40,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2019-09-08 02:19:40,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:19:40,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 103 [2019-09-08 02:19:40,739 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,857 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 02:19:40,858 INFO L567 ElimStorePlain]: treesize reduction 28, result has 81.6 percent of original size [2019-09-08 02:19:40,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:40,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 94 [2019-09-08 02:19:40,881 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:40,998 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 02:19:40,999 INFO L567 ElimStorePlain]: treesize reduction 36, result has 78.0 percent of original size [2019-09-08 02:19:41,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-08 02:19:41,000 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:136, output treesize:166 [2019-09-08 02:19:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:41,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:41,142 INFO L375 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 2 case distinctions, treesize of input 86 treesize of output 96 [2019-09-08 02:19:41,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:41,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:41,165 INFO L375 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 2 case distinctions, treesize of input 79 treesize of output 89 [2019-09-08 02:19:41,165 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:41,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:41,183 INFO L375 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 2 case distinctions, treesize of input 90 treesize of output 100 [2019-09-08 02:19:41,184 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:41,346 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-09-08 02:19:41,346 INFO L567 ElimStorePlain]: treesize reduction 23, result has 90.2 percent of original size [2019-09-08 02:19:41,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-09-08 02:19:41,347 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:256, output treesize:212 [2019-09-08 02:19:41,729 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 02:19:41,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:19:41,734 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_150, v_prenex_146, v_prenex_147, v_prenex_149], 9=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_43|]} [2019-09-08 02:19:41,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:41,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 100 [2019-09-08 02:19:41,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:42,061 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-08 02:19:42,061 INFO L567 ElimStorePlain]: treesize reduction 32, result has 89.5 percent of original size [2019-09-08 02:19:42,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:19:42,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 95 treesize of output 97 [2019-09-08 02:19:42,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:42,198 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-09-08 02:19:42,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:42,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:42,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 96 [2019-09-08 02:19:42,228 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:42,443 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-09-08 02:19:42,443 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.2 percent of original size [2019-09-08 02:19:42,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:19:42,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2019-09-08 02:19:42,458 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:42,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:42,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:19:42,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:19:42,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:19:42,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:42,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 143 [2019-09-08 02:19:42,585 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:19:42,762 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-08 02:19:42,762 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-09-08 02:19:42,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:19:42,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 141 [2019-09-08 02:19:42,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:42,841 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:19:43,033 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-08 02:19:43,033 INFO L567 ElimStorePlain]: treesize reduction 84, result has 73.4 percent of original size [2019-09-08 02:19:43,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-09-08 02:19:43,034 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:281, output treesize:312 [2019-09-08 02:19:43,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:45,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:19:45,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:19:46,869 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-09-08 02:19:46,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:19:47,234 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-09-08 02:19:47,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:19:47,733 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-09-08 02:19:47,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:19:48,244 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-09-08 02:19:48,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:19:48,809 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-09-08 02:19:48,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:19:49,942 WARN L188 SmtUtils]: Spent 889.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-09-08 02:19:49,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:19:51,099 WARN L188 SmtUtils]: Spent 788.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-09-08 02:19:52,246 WARN L188 SmtUtils]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 309 [2019-09-08 02:19:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 02:19:52,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:19:52,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 46 [2019-09-08 02:19:52,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 02:19:52,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 02:19:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1950, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:19:52,374 INFO L87 Difference]: Start difference. First operand 261 states and 326 transitions. Second operand 46 states. [2019-09-08 02:19:53,084 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-09-08 02:19:53,719 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2019-09-08 02:19:54,198 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 47 [2019-09-08 02:19:54,854 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 69 [2019-09-08 02:19:55,165 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-09-08 02:19:56,040 WARN L188 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 107 [2019-09-08 02:19:57,629 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-09-08 02:19:58,319 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-09-08 02:19:58,659 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-08 02:19:59,485 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 70 [2019-09-08 02:20:01,982 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 321 DAG size of output: 312 [2019-09-08 02:20:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:20:02,438 INFO L93 Difference]: Finished difference Result 318 states and 403 transitions. [2019-09-08 02:20:02,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:20:02,438 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 70 [2019-09-08 02:20:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:20:02,443 INFO L225 Difference]: With dead ends: 318 [2019-09-08 02:20:02,443 INFO L226 Difference]: Without dead ends: 311 [2019-09-08 02:20:02,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=207, Invalid=3333, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:20:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-08 02:20:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2019-09-08 02:20:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 02:20:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 327 transitions. [2019-09-08 02:20:02,484 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 327 transitions. Word has length 70 [2019-09-08 02:20:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:20:02,484 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 327 transitions. [2019-09-08 02:20:02,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 02:20:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 327 transitions. [2019-09-08 02:20:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 02:20:02,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:20:02,486 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 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-09-08 02:20:02,486 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:20:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:20:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash 343971637, now seen corresponding path program 12 times [2019-09-08 02:20:02,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:20:02,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:20:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:20:02,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:20:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:20:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:20:02,945 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 02:20:03,092 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 02:20:04,170 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 02:20:04,359 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 02:20:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:20:04,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:20:04,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:20:04,751 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:20:04,806 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-08 02:20:04,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:20:04,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-08 02:20:04,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:20:04,814 INFO L375 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-09-08 02:20:04,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:04,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:04,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:20:04,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:20:04,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:20:04,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:04,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:04,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:20:04,891 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:04,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:04,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:20:04,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-09-08 02:20:04,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:04,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 02:20:04,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:04,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:04,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:20:04,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-09-08 02:20:05,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:20:05,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:05,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:05,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:20:05,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:05,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:05,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:20:05,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-09-08 02:20:05,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:05,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 79 [2019-09-08 02:20:05,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,211 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:20:05,269 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.0 percent of original size [2019-09-08 02:20:05,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:05,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-09-08 02:20:05,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:05,362 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.4 percent of original size [2019-09-08 02:20:05,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:20:05,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:67 [2019-09-08 02:20:05,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:05,685 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-08 02:20:05,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:20:05,691 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_190, v_prenex_185, v_prenex_187, v_prenex_188], 9=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|]} [2019-09-08 02:20:05,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:05,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 112 [2019-09-08 02:20:05,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:05,963 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-08 02:20:05,964 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.1 percent of original size [2019-09-08 02:20:06,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:06,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 100 [2019-09-08 02:20:06,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,011 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:20:06,212 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-09-08 02:20:06,212 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.3 percent of original size [2019-09-08 02:20:06,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:06,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 92 [2019-09-08 02:20:06,255 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:06,449 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-08 02:20:06,450 INFO L567 ElimStorePlain]: treesize reduction 32, result has 86.6 percent of original size [2019-09-08 02:20:06,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:06,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 96 [2019-09-08 02:20:06,487 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:06,662 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-08 02:20:06,663 INFO L567 ElimStorePlain]: treesize reduction 36, result has 84.7 percent of original size [2019-09-08 02:20:06,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:06,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 149 [2019-09-08 02:20:06,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:06,831 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:20:07,070 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-08 02:20:07,071 INFO L567 ElimStorePlain]: treesize reduction 48, result has 80.7 percent of original size [2019-09-08 02:20:07,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:20:07,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 92 treesize of output 153 [2019-09-08 02:20:07,122 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:20:07,318 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-08 02:20:07,319 INFO L567 ElimStorePlain]: treesize reduction 48, result has 80.4 percent of original size [2019-09-08 02:20:07,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-09-08 02:20:07,326 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:220, output treesize:232 [2019-09-08 02:20:07,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:07,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:08,986 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 73 [2019-09-08 02:20:09,438 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-08 02:20:09,847 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-08 02:20:10,425 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-09-08 02:20:10,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-08 02:20:12,044 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-09-08 02:20:12,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:20:15,081 WARN L188 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 160 [2019-09-08 02:20:15,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:20:16,980 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 173 [2019-09-08 02:20:16,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-08 02:20:18,448 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 318 [2019-09-08 02:20:18,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-08 02:20:20,977 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 322 [2019-09-08 02:20:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:20:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-08 02:20:20,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-08 02:20:25,240 WARN L188 SmtUtils]: Spent 3.62 s on a formula simplification that was a NOOP. DAG size: 622 [2019-09-08 02:20:25,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-09-08 02:20:30,616 WARN L188 SmtUtils]: Spent 4.69 s on a formula simplification that was a NOOP. DAG size: 626 [2019-09-08 02:20:30,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-09-08 02:20:37,849 WARN L188 SmtUtils]: Spent 6.55 s on a formula simplification that was a NOOP. DAG size: 626 [2019-09-08 02:20:47,283 WARN L188 SmtUtils]: Spent 8.73 s on a formula simplification that was a NOOP. DAG size: 625 [2019-09-08 02:20:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 02:20:47,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:20:47,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2019-09-08 02:20:47,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 02:20:47,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 02:20:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1952, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:20:47,531 INFO L87 Difference]: Start difference. First operand 262 states and 327 transitions. Second operand 46 states. [2019-09-08 02:20:48,272 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-08 02:20:48,941 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-09-08 02:20:49,318 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-08 02:20:49,933 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 133 [2019-09-08 02:20:50,241 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-09-08 02:20:51,189 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 191 [2019-09-08 02:20:53,102 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 02:20:54,058 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-09-08 02:20:54,784 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 84 [2019-09-08 02:20:56,299 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 191 DAG size of output: 147 [2019-09-08 02:21:12,380 WARN L188 SmtUtils]: Spent 14.33 s on a formula simplification. DAG size of input: 649 DAG size of output: 628 [2019-09-08 02:21:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:21:13,459 INFO L93 Difference]: Finished difference Result 327 states and 416 transitions. [2019-09-08 02:21:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:21:13,459 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 71 [2019-09-08 02:21:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:21:13,462 INFO L225 Difference]: With dead ends: 327 [2019-09-08 02:21:13,462 INFO L226 Difference]: Without dead ends: 320 [2019-09-08 02:21:13,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=204, Invalid=3336, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:21:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-08 02:21:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-08 02:21:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-08 02:21:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 328 transitions. [2019-09-08 02:21:13,513 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 328 transitions. Word has length 71 [2019-09-08 02:21:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:21:13,513 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 328 transitions. [2019-09-08 02:21:13,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 02:21:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 328 transitions. [2019-09-08 02:21:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 02:21:13,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:21:13,515 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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, 1, 1] [2019-09-08 02:21:13,516 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:21:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:21:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash 642633996, now seen corresponding path program 2 times [2019-09-08 02:21:13,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:21:13,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:21:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:21:13,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:21:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:21:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:21:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 47 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 02:21:13,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:21:13,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:21:13,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:21:13,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:21:13,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:21:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:21:13,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:21:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 34 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 02:21:13,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:21:13,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 02:21:13,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:21:13,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:21:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:21:13,788 INFO L87 Difference]: Start difference. First operand 263 states and 328 transitions. Second operand 16 states. [2019-09-08 02:21:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:21:14,310 INFO L93 Difference]: Finished difference Result 472 states and 618 transitions. [2019-09-08 02:21:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:21:14,310 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-08 02:21:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:21:14,312 INFO L225 Difference]: With dead ends: 472 [2019-09-08 02:21:14,312 INFO L226 Difference]: Without dead ends: 339 [2019-09-08 02:21:14,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:21:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-08 02:21:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 260. [2019-09-08 02:21:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-08 02:21:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 322 transitions. [2019-09-08 02:21:14,362 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 322 transitions. Word has length 71 [2019-09-08 02:21:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:21:14,362 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 322 transitions. [2019-09-08 02:21:14,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:21:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 322 transitions. [2019-09-08 02:21:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:21:14,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:21:14,364 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 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-09-08 02:21:14,364 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:21:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:21:14,364 INFO L82 PathProgramCache]: Analyzing trace with hash 85005563, now seen corresponding path program 13 times [2019-09-08 02:21:14,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:21:14,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:21:14,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:21:14,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:21:14,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:21:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:21:15,085 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 02:21:15,280 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 02:21:15,493 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-08 02:21:15,695 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 02:21:15,910 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-08 02:21:16,124 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-08 02:21:16,684 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-08 02:21:16,959 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-08 02:21:17,238 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-08 02:21:17,515 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 02:21:17,783 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-08 02:21:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:21:17,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:21:17,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:21:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:21:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:21:17,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-08 02:21:17,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:21:17,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:21:17,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:17,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:17,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:21:17,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:17,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:17,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:21:17,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-09-08 02:21:18,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:18,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 34 [2019-09-08 02:21:18,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,160 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-08 02:21:18,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:18,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 34 [2019-09-08 02:21:18,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,213 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-09-08 02:21:18,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:41 [2019-09-08 02:21:18,297 INFO L375 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 38 treesize of output 37 [2019-09-08 02:21:18,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,303 INFO L375 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 42 treesize of output 41 [2019-09-08 02:21:18,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,361 INFO L567 ElimStorePlain]: treesize reduction 7, result has 91.1 percent of original size [2019-09-08 02:21:18,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-09-08 02:21:18,362 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:72 [2019-09-08 02:21:18,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,458 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_50|], 5=[v_prenex_256, v_prenex_257]} [2019-09-08 02:21:18,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:18,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 76 [2019-09-08 02:21:18,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,616 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 02:21:18,616 INFO L567 ElimStorePlain]: treesize reduction 28, result has 79.1 percent of original size [2019-09-08 02:21:18,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:18,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 56 [2019-09-08 02:21:18,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,753 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 02:21:18,753 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.0 percent of original size [2019-09-08 02:21:18,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:18,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 118 [2019-09-08 02:21:18,804 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:18,919 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 02:21:18,919 INFO L567 ElimStorePlain]: treesize reduction 44, result has 68.1 percent of original size [2019-09-08 02:21:18,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:18,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 97 [2019-09-08 02:21:18,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:18,977 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:21:19,101 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 02:21:19,101 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.4 percent of original size [2019-09-08 02:21:19,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-08 02:21:19,104 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:110, output treesize:119 [2019-09-08 02:21:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:19,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:19,379 INFO L375 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 1 case distinctions, treesize of input 68 treesize of output 72 [2019-09-08 02:21:19,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,392 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:19,393 INFO L375 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 1 case distinctions, treesize of input 54 treesize of output 58 [2019-09-08 02:21:19,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:21:19,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:21:19,402 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2019-09-08 02:21:19,402 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,410 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:21:19,410 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,417 INFO L375 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 60 treesize of output 56 [2019-09-08 02:21:19,418 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:19,434 INFO L375 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 1 case distinctions, treesize of input 85 treesize of output 89 [2019-09-08 02:21:19,434 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:19,454 INFO L375 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 1 case distinctions, treesize of input 65 treesize of output 69 [2019-09-08 02:21:19,454 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,459 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:21:19,467 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2019-09-08 02:21:19,468 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:19,603 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-08 02:21:19,603 INFO L567 ElimStorePlain]: treesize reduction 143, result has 52.2 percent of original size [2019-09-08 02:21:19,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-09-08 02:21:19,604 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:529, output treesize:156 [2019-09-08 02:21:19,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:21:19,741 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_260, |v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_51|, v_prenex_259], 9=[v_prenex_262, v_prenex_263]} [2019-09-08 02:21:19,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:19,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 88 [2019-09-08 02:21:19,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:20,015 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-09-08 02:21:20,015 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.6 percent of original size [2019-09-08 02:21:20,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:20,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 105 [2019-09-08 02:21:20,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:20,267 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-09-08 02:21:20,267 INFO L567 ElimStorePlain]: treesize reduction 44, result has 82.9 percent of original size [2019-09-08 02:21:20,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:20,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 84 [2019-09-08 02:21:20,295 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:20,488 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-08 02:21:20,489 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.2 percent of original size [2019-09-08 02:21:20,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:20,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 113 [2019-09-08 02:21:20,525 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:20,697 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-08 02:21:20,698 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.0 percent of original size [2019-09-08 02:21:20,794 INFO L341 Elim1Store]: treesize reduction 12, result has 91.6 percent of original size [2019-09-08 02:21:20,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 82 treesize of output 191 [2019-09-08 02:21:20,795 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:21:20,975 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 02:21:20,975 INFO L567 ElimStorePlain]: treesize reduction 68, result has 74.7 percent of original size [2019-09-08 02:21:21,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:21:21,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 133 [2019-09-08 02:21:21,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,031 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:21:21,230 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 02:21:21,230 INFO L567 ElimStorePlain]: treesize reduction 48, result has 82.6 percent of original size [2019-09-08 02:21:21,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-09-08 02:21:21,234 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:213, output treesize:283 [2019-09-08 02:21:21,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,501 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 02:21:21,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:21,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:22,086 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-09-08 02:21:23,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:21:23,974 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-09-08 02:21:23,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:21:24,323 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-09-08 02:21:24,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:21:24,738 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-09-08 02:21:24,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:21:25,491 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-09-08 02:21:25,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:21:26,486 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2019-09-08 02:21:26,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:21:26,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:21:26,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:21:28,740 WARN L188 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 530 [2019-09-08 02:21:28,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:21:31,319 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 534 [2019-09-08 02:21:31,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:21:34,348 WARN L188 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 538 [2019-09-08 02:21:34,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:21:37,334 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 538 [2019-09-08 02:21:40,181 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 537 [2019-09-08 02:21:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 02:21:40,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:21:40,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2019-09-08 02:21:40,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 02:21:40,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 02:21:40,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2132, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:21:40,386 INFO L87 Difference]: Start difference. First operand 260 states and 322 transitions. Second operand 48 states. [2019-09-08 02:21:41,187 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-09-08 02:21:42,229 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 50 [2019-09-08 02:21:42,976 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 100 [2019-09-08 02:21:43,331 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2019-09-08 02:21:44,370 WARN L188 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 153 [2019-09-08 02:21:47,105 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-09-08 02:21:47,837 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-09-08 02:21:48,191 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 54 [2019-09-08 02:21:49,072 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 100 [2019-09-08 02:21:55,174 WARN L188 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 557 DAG size of output: 540 [2019-09-08 02:21:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:21:55,799 INFO L93 Difference]: Finished difference Result 333 states and 422 transitions. [2019-09-08 02:21:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:21:55,799 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 72 [2019-09-08 02:21:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:21:55,801 INFO L225 Difference]: With dead ends: 333 [2019-09-08 02:21:55,801 INFO L226 Difference]: Without dead ends: 326 [2019-09-08 02:21:55,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=210, Invalid=3572, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 02:21:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-08 02:21:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 261. [2019-09-08 02:21:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-08 02:21:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 323 transitions. [2019-09-08 02:21:55,859 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 323 transitions. Word has length 72 [2019-09-08 02:21:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:21:55,859 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 323 transitions. [2019-09-08 02:21:55,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 02:21:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 323 transitions. [2019-09-08 02:21:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 02:21:55,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:21:55,861 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:21:55,861 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:21:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:21:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash 10025111, now seen corresponding path program 1 times [2019-09-08 02:21:55,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:21:55,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:21:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:21:55,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:21:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:21:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:21:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 02:21:56,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:21:56,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:21:56,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:21:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:21:56,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 02:21:56,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:22:00,617 INFO L375 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 8 treesize of output 4 [2019-09-08 02:22:00,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:22:00,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:22:00,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:22:00,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:22:02,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:22:02,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:22:02,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:22:02,747 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-09-08 02:22:02,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:49 [2019-09-08 02:22:04,750 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_insert_~new_node~0.base Int)) (and (<= (+ |c_#StackHeapBarrier| 1) sll_insert_~new_node~0.base) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (select (select |c_#memory_$Pointer$.offset| |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (select (select |c_old(#memory_$Pointer$.base)| |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))))) (store .cse0 |c_sll_insert_#in~head.base| (store (select .cse0 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset| sll_insert_~new_node~0.base)))))) is different from true [2019-09-08 02:22:04,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:22:04,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 23 [2019-09-08 02:22:04,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:22:04,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:22:04,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:22:04,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:29 [2019-09-08 02:22:04,813 INFO L375 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 24 treesize of output 16 [2019-09-08 02:22:04,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:22:04,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:22:04,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:22:04,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2019-09-08 02:22:06,876 WARN L860 $PredicateComparison]: unable to prove that (exists ((|main_~#s~0.base| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (and (<= (+ |main_~#s~0.base| 2) .cse0) (not (= 0 (select (select |c_#memory_$Pointer$.base| .cse0) |v_main_#t~mem19.offset_BEFORE_CALL_11|)))))) is different from true [2019-09-08 02:22:10,922 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-08 02:22:14,966 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-08 02:22:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 02:22:15,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:22:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 33 [2019-09-08 02:22:15,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:22:15,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:22:15,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=844, Unknown=6, NotChecked=118, Total=1056 [2019-09-08 02:22:15,029 INFO L87 Difference]: Start difference. First operand 261 states and 323 transitions. Second operand 33 states. [2019-09-08 02:22:33,977 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-08 02:22:40,086 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 58 [2019-09-08 02:23:08,679 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 02:23:09,285 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-09-08 02:23:09,994 WARN L188 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-09-08 02:23:10,687 WARN L188 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-09-08 02:24:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:24:13,460 INFO L93 Difference]: Finished difference Result 308 states and 386 transitions. [2019-09-08 02:24:13,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:24:13,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 75 [2019-09-08 02:24:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:24:13,462 INFO L225 Difference]: With dead ends: 308 [2019-09-08 02:24:13,462 INFO L226 Difference]: Without dead ends: 298 [2019-09-08 02:24:13,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 86.0s TimeCoverageRelationStatistics Valid=233, Invalid=2603, Unknown=34, NotChecked=210, Total=3080 [2019-09-08 02:24:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-08 02:24:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 276. [2019-09-08 02:24:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-08 02:24:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 345 transitions. [2019-09-08 02:24:13,524 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 345 transitions. Word has length 75 [2019-09-08 02:24:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:24:13,524 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 345 transitions. [2019-09-08 02:24:13,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:24:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 345 transitions. [2019-09-08 02:24:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 02:24:13,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:24:13,526 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 4, 4, 4, 4, 4, 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-09-08 02:24:13,526 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:24:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:24:13,527 INFO L82 PathProgramCache]: Analyzing trace with hash 646991861, now seen corresponding path program 14 times [2019-09-08 02:24:13,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:24:13,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:24:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:24:13,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:24:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:24:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:24:14,008 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-08 02:24:14,141 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-09-08 02:24:14,309 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-08 02:24:14,446 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-09-08 02:24:14,884 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-09-08 02:24:15,552 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-08 02:24:15,797 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-09-08 02:24:16,062 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-09-08 02:24:16,322 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-09-08 02:24:16,530 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-09-08 02:24:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:24:16,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:24:16,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:24:16,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:24:16,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:24:16,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:24:16,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-08 02:24:16,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:24:16,869 INFO L375 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-09-08 02:24:16,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:16,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:16,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:24:16,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:24:16,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:24:16,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:16,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:16,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:24:16,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:16,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:16,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:24:16,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-09-08 02:24:17,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 02:24:17,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-09-08 02:24:17,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:24:17,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:24:17,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,158 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-09-08 02:24:17,226 INFO L375 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-09-08 02:24:17,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:49 [2019-09-08 02:24:17,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 79 [2019-09-08 02:24:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,356 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:24:17,421 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.7 percent of original size [2019-09-08 02:24:17,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-09-08 02:24:17,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,523 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.3 percent of original size [2019-09-08 02:24:17,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:24:17,525 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:72 [2019-09-08 02:24:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:17,718 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,719 INFO L375 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 1 case distinctions, treesize of input 85 treesize of output 89 [2019-09-08 02:24:17,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,730 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,731 INFO L375 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 1 case distinctions, treesize of input 81 treesize of output 85 [2019-09-08 02:24:17,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:17,746 INFO L375 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 1 case distinctions, treesize of input 68 treesize of output 72 [2019-09-08 02:24:17,746 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:17,884 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 02:24:17,885 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-09-08 02:24:17,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-09-08 02:24:17,886 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:235, output treesize:203 [2019-09-08 02:24:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:24:18,045 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_305, |v_#memory_$Pointer$.base_57|, v_prenex_303, |v_#memory_$Pointer$.offset_53|], 9=[v_prenex_300, v_prenex_302]} [2019-09-08 02:24:18,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:18,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 92 [2019-09-08 02:24:18,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:18,356 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-08 02:24:18,357 INFO L567 ElimStorePlain]: treesize reduction 16, result has 94.1 percent of original size [2019-09-08 02:24:18,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:18,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 92 [2019-09-08 02:24:18,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:18,623 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-09-08 02:24:18,623 INFO L567 ElimStorePlain]: treesize reduction 32, result has 87.9 percent of original size [2019-09-08 02:24:18,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:18,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 88 [2019-09-08 02:24:18,661 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:18,870 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-09-08 02:24:18,871 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.8 percent of original size [2019-09-08 02:24:18,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:24:18,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:18,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 93 [2019-09-08 02:24:18,902 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:19,090 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-08 02:24:19,091 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.7 percent of original size [2019-09-08 02:24:19,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:19,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 141 [2019-09-08 02:24:19,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,156 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:24:19,375 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-09-08 02:24:19,376 INFO L567 ElimStorePlain]: treesize reduction 68, result has 76.3 percent of original size [2019-09-08 02:24:19,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:24:19,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:24:19,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 154 [2019-09-08 02:24:19,427 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:24:19,623 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-08 02:24:19,624 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.0 percent of original size [2019-09-08 02:24:19,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-09-08 02:24:19,626 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:260, output treesize:266 [2019-09-08 02:24:19,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,891 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 02:24:19,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:19,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:20,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:20,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:20,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:24:20,404 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 02:24:21,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:24:22,267 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-08 02:24:22,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:24:22,620 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-09-08 02:24:22,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:24:23,335 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-09-08 02:24:23,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:24:24,244 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2019-09-08 02:24:24,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:24:25,285 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2019-09-08 02:24:25,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:24:27,472 WARN L188 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 286 [2019-09-08 02:24:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:24:30,176 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 522 [2019-09-08 02:24:30,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:24:33,312 WARN L188 SmtUtils]: Spent 2.55 s on a formula simplification that was a NOOP. DAG size: 526 [2019-09-08 02:24:33,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:24:36,796 WARN L188 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 530 [2019-09-08 02:24:36,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:24:40,208 WARN L188 SmtUtils]: Spent 2.80 s on a formula simplification that was a NOOP. DAG size: 530 [2019-09-08 02:24:43,494 WARN L188 SmtUtils]: Spent 2.66 s on a formula simplification that was a NOOP. DAG size: 529 [2019-09-08 02:24:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 02:24:43,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:24:43,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2019-09-08 02:24:43,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 02:24:43,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 02:24:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2322, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:24:43,715 INFO L87 Difference]: Start difference. First operand 276 states and 345 transitions. Second operand 50 states. [2019-09-08 02:24:45,286 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 67 [2019-09-08 02:24:45,813 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 61 [2019-09-08 02:24:46,616 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-09-08 02:24:47,091 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-08 02:24:48,183 WARN L188 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 155 [2019-09-08 02:24:51,670 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-08 02:24:52,503 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-08 02:24:52,874 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-08 02:24:54,029 WARN L188 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-09-08 02:25:01,822 WARN L188 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 549 DAG size of output: 532 [2019-09-08 02:25:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:25:02,643 INFO L93 Difference]: Finished difference Result 353 states and 460 transitions. [2019-09-08 02:25:02,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:25:02,644 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 73 [2019-09-08 02:25:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:25:02,646 INFO L225 Difference]: With dead ends: 353 [2019-09-08 02:25:02,646 INFO L226 Difference]: Without dead ends: 346 [2019-09-08 02:25:02,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=212, Invalid=3820, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:25:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-08 02:25:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 277. [2019-09-08 02:25:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-08 02:25:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 346 transitions. [2019-09-08 02:25:02,735 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 346 transitions. Word has length 73 [2019-09-08 02:25:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:25:02,735 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 346 transitions. [2019-09-08 02:25:02,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 02:25:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 346 transitions. [2019-09-08 02:25:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 02:25:02,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:25:02,737 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 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-09-08 02:25:02,738 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:25:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:25:02,738 INFO L82 PathProgramCache]: Analyzing trace with hash 758242734, now seen corresponding path program 15 times [2019-09-08 02:25:02,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:25:02,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:25:02,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:25:02,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:25:02,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:25:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:25:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 02:25:02,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:25:02,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:25:02,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:25:02,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-08 02:25:02,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:25:02,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 02:25:02,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:25:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 02:25:02,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:25:02,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 02:25:02,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:25:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:25:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:25:02,977 INFO L87 Difference]: Start difference. First operand 277 states and 346 transitions. Second operand 15 states. [2019-09-08 02:25:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:25:03,309 INFO L93 Difference]: Finished difference Result 475 states and 622 transitions. [2019-09-08 02:25:03,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:25:03,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-08 02:25:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:25:03,311 INFO L225 Difference]: With dead ends: 475 [2019-09-08 02:25:03,312 INFO L226 Difference]: Without dead ends: 353 [2019-09-08 02:25:03,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:25:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-08 02:25:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 277. [2019-09-08 02:25:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-08 02:25:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-09-08 02:25:03,389 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 73 [2019-09-08 02:25:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:25:03,389 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-09-08 02:25:03,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:25:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-09-08 02:25:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 02:25:03,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:25:03,391 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:25:03,391 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:25:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:25:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1677402151, now seen corresponding path program 2 times [2019-09-08 02:25:03,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:25:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:25:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:25:03,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:25:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:25:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:25:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 02:25:04,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:25:04,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:25:04,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:25:04,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:25:04,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:25:04,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 02:25:04,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:25:04,205 INFO L375 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-09-08 02:25:04,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:25:04,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:04,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:25:04,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-09-08 02:25:04,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:25:04,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:25:04,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:04,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:25:04,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-08 02:25:04,566 INFO L375 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-09-08 02:25:04,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:25:04,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:04,583 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_1|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_3|]} [2019-09-08 02:25:04,586 INFO L375 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 16 treesize of output 12 [2019-09-08 02:25:04,587 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:25:04,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:04,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:04,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2019-09-08 02:25:04,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:25:04,614 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:25:04,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:04,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:25:04,624 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:10 [2019-09-08 02:25:08,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:08,955 INFO L375 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-09-08 02:25:08,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:25:08,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:08,986 INFO L392 ElimStorePlain]: Different costs {4=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_30|], 10=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_30|]} [2019-09-08 02:25:08,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:25:08,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 27 [2019-09-08 02:25:08,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:25:09,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:09,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:25:09,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:25:09,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 140 [2019-09-08 02:25:09,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:25:09,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:25:09,073 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:25:09,140 INFO L567 ElimStorePlain]: treesize reduction 191, result has 22.7 percent of original size [2019-09-08 02:25:09,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:25:09,141 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:118, output treesize:82 [2019-09-08 02:25:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 02:25:10,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:25:10,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 36 [2019-09-08 02:25:10,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:25:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:25:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1167, Unknown=2, NotChecked=0, Total=1260 [2019-09-08 02:25:10,062 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 36 states. [2019-09-08 02:25:18,561 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-08 02:25:24,810 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 02:25:39,150 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-08 02:25:43,195 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 02:25:47,503 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-08 02:25:55,835 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-09-08 02:26:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:26:09,028 INFO L93 Difference]: Finished difference Result 355 states and 442 transitions. [2019-09-08 02:26:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 02:26:09,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-08 02:26:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:26:09,030 INFO L225 Difference]: With dead ends: 355 [2019-09-08 02:26:09,030 INFO L226 Difference]: Without dead ends: 348 [2019-09-08 02:26:09,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=274, Invalid=3625, Unknown=7, NotChecked=0, Total=3906 [2019-09-08 02:26:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-08 02:26:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 286. [2019-09-08 02:26:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-08 02:26:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 354 transitions. [2019-09-08 02:26:09,110 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 354 transitions. Word has length 76 [2019-09-08 02:26:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:26:09,111 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 354 transitions. [2019-09-08 02:26:09,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:26:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 354 transitions. [2019-09-08 02:26:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 02:26:09,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:26:09,113 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:26:09,113 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:26:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:26:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 135282332, now seen corresponding path program 1 times [2019-09-08 02:26:09,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:26:09,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:26:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:26:09,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:26:09,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:26:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:26:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 02:26:09,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:26:09,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:26:09,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:26:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:26:09,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:26:09,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:26:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 02:26:09,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:26:09,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-08 02:26:09,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:26:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:26:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:26:09,358 INFO L87 Difference]: Start difference. First operand 286 states and 354 transitions. Second operand 16 states. [2019-09-08 02:26:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:26:09,685 INFO L93 Difference]: Finished difference Result 393 states and 500 transitions. [2019-09-08 02:26:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:26:09,686 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-09-08 02:26:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:26:09,687 INFO L225 Difference]: With dead ends: 393 [2019-09-08 02:26:09,688 INFO L226 Difference]: Without dead ends: 319 [2019-09-08 02:26:09,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:26:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-08 02:26:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 303. [2019-09-08 02:26:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 02:26:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 376 transitions. [2019-09-08 02:26:09,756 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 376 transitions. Word has length 76 [2019-09-08 02:26:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:26:09,757 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 376 transitions. [2019-09-08 02:26:09,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:26:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 376 transitions. [2019-09-08 02:26:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 02:26:09,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:26:09,759 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 4, 4, 4, 4, 4, 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-09-08 02:26:09,759 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:26:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:26:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash 888697915, now seen corresponding path program 16 times [2019-09-08 02:26:09,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:26:09,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:26:09,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:26:09,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:26:09,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:26:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:26:11,348 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-08 02:26:11,597 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2019-09-08 02:26:11,840 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-08 02:26:12,084 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-08 02:26:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:26:12,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:26:12,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:26:12,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:26:12,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:26:12,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:26:12,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-08 02:26:12,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:26:12,715 INFO L375 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-09-08 02:26:12,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:12,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:26:12,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:26:12,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:12,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:26:12,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:12,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-09-08 02:26:12,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:12,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 02:26:12,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,805 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-09-08 02:26:12,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-09-08 02:26:12,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:26:12,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:12,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:26:12,908 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:12,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:26:12,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-09-08 02:26:13,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:13,016 INFO L375 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 20 treesize of output 30 [2019-09-08 02:26:13,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:13,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:13,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:26:13,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-09-08 02:26:13,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-09-08 02:26:13,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:13,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:13,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:13,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 67 [2019-09-08 02:26:13,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:13,210 INFO L567 ElimStorePlain]: treesize reduction 48, result has 56.8 percent of original size [2019-09-08 02:26:13,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:26:13,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:80 [2019-09-08 02:26:13,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:26:13,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:13,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 134 [2019-09-08 02:26:13,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:26:13,510 INFO L567 ElimStorePlain]: treesize reduction 84, result has 54.8 percent of original size [2019-09-08 02:26:13,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:26:13,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 132 [2019-09-08 02:26:13,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,608 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:26:13,712 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 02:26:13,712 INFO L567 ElimStorePlain]: treesize reduction 56, result has 61.1 percent of original size [2019-09-08 02:26:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:26:13,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:101 [2019-09-08 02:26:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:14,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:14,407 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-08 02:26:14,860 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 02:26:15,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:26:16,494 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-09-08 02:26:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:26:16,900 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-09-08 02:26:16,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:16,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:26:16,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:26:17,723 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 300 [2019-09-08 02:26:17,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-08 02:26:19,441 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 316 [2019-09-08 02:26:19,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:26:21,458 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 590 [2019-09-08 02:26:21,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:26:21,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:26:21,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-09-08 02:26:26,522 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 1154 [2019-09-08 02:26:26,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-09-08 02:26:32,204 WARN L188 SmtUtils]: Spent 4.54 s on a formula simplification that was a NOOP. DAG size: 1158 [2019-09-08 02:26:32,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-09-08 02:26:38,444 WARN L188 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 1162 [2019-09-08 02:26:38,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-09-08 02:26:45,218 WARN L188 SmtUtils]: Spent 5.71 s on a formula simplification that was a NOOP. DAG size: 1166 [2019-09-08 02:26:45,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-09-08 02:26:52,628 WARN L188 SmtUtils]: Spent 6.31 s on a formula simplification that was a NOOP. DAG size: 1170 [2019-09-08 02:26:52,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-09-08 02:27:04,448 WARN L188 SmtUtils]: Spent 10.72 s on a formula simplification that was a NOOP. DAG size: 1170 [2019-09-08 02:27:11,648 WARN L188 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 1169 [2019-09-08 02:27:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 13 proven. 87 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 02:27:12,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:12,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 50 [2019-09-08 02:27:12,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 02:27:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 02:27:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2316, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:27:12,120 INFO L87 Difference]: Start difference. First operand 303 states and 376 transitions. Second operand 50 states. [2019-09-08 02:27:12,853 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-08 02:27:13,077 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-09-08 02:27:14,479 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 133 [2019-09-08 02:27:16,558 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-08 02:27:17,738 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-08 02:27:36,548 WARN L188 SmtUtils]: Spent 17.33 s on a formula simplification. DAG size of input: 1205 DAG size of output: 1172 [2019-09-08 02:27:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:37,193 INFO L93 Difference]: Finished difference Result 426 states and 544 transitions. [2019-09-08 02:27:37,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:27:37,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2019-09-08 02:27:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:37,196 INFO L225 Difference]: With dead ends: 426 [2019-09-08 02:27:37,196 INFO L226 Difference]: Without dead ends: 419 [2019-09-08 02:27:37,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 80.3s TimeCoverageRelationStatistics Valid=201, Invalid=3459, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 02:27:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-08 02:27:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 304. [2019-09-08 02:27:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 02:27:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 377 transitions. [2019-09-08 02:27:37,304 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 377 transitions. Word has length 74 [2019-09-08 02:27:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:37,304 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 377 transitions. [2019-09-08 02:27:37,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 02:27:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 377 transitions. [2019-09-08 02:27:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 02:27:37,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:37,306 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:37,307 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1846927575, now seen corresponding path program 3 times [2019-09-08 02:27:37,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:37,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:37,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 02:27:37,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:37,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:37,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:27:37,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:27:37,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:37,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:27:37,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:37,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 02:27:38,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 32 [2019-09-08 02:27:38,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:27:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:27:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:27:38,121 INFO L87 Difference]: Start difference. First operand 304 states and 377 transitions. Second operand 32 states. [2019-09-08 02:27:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:39,835 INFO L93 Difference]: Finished difference Result 456 states and 637 transitions. [2019-09-08 02:27:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:27:39,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 77 [2019-09-08 02:27:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:39,838 INFO L225 Difference]: With dead ends: 456 [2019-09-08 02:27:39,838 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 02:27:39,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=341, Invalid=2739, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:27:39,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 02:27:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 356. [2019-09-08 02:27:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-08 02:27:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 474 transitions. [2019-09-08 02:27:39,931 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 474 transitions. Word has length 77 [2019-09-08 02:27:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:39,932 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 474 transitions. [2019-09-08 02:27:39,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:27:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 474 transitions. [2019-09-08 02:27:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 02:27:39,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:39,934 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:39,934 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1746439847, now seen corresponding path program 4 times [2019-09-08 02:27:39,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:39,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:39,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:39,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:39,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 02:27:40,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:40,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:40,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:27:40,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:27:40,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:40,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:27:40,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:40,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 02:27:40,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:40,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 25 [2019-09-08 02:27:40,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:27:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:27:40,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:27:40,512 INFO L87 Difference]: Start difference. First operand 356 states and 474 transitions. Second operand 25 states. [2019-09-08 02:27:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:41,854 INFO L93 Difference]: Finished difference Result 795 states and 1056 transitions. [2019-09-08 02:27:41,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:27:41,855 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-08 02:27:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:41,857 INFO L225 Difference]: With dead ends: 795 [2019-09-08 02:27:41,857 INFO L226 Difference]: Without dead ends: 358 [2019-09-08 02:27:41,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=269, Invalid=1987, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:27:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-08 02:27:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 319. [2019-09-08 02:27:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 02:27:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 398 transitions. [2019-09-08 02:27:41,972 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 398 transitions. Word has length 77 [2019-09-08 02:27:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:41,973 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 398 transitions. [2019-09-08 02:27:41,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:27:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 398 transitions. [2019-09-08 02:27:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 02:27:41,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:41,975 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 4, 4, 4, 4, 4, 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-09-08 02:27:41,975 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash -208349003, now seen corresponding path program 17 times [2019-09-08 02:27:41,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:41,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:41,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:41,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:42,659 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-08 02:27:42,806 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-09-08 02:27:42,960 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-09-08 02:27:43,114 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-09-08 02:27:43,283 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-09-08 02:27:43,457 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-09-08 02:27:43,983 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 02:27:44,212 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-08 02:27:44,507 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-09-08 02:27:44,789 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 79 [2019-09-08 02:27:45,097 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-09-08 02:27:45,388 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-09-08 02:27:45,630 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 62 [2019-09-08 02:27:45,866 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2019-09-08 02:27:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 02:27:45,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:45,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:45,927 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:27:45,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 02:27:45,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:45,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-08 02:27:46,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:46,003 INFO L375 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-09-08 02:27:46,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:27:46,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:27:46,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:27:46,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,106 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-09-08 02:27:46,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 02:27:46,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,244 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-09-08 02:27:46,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-09-08 02:27:46,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:27:46,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-09-08 02:27:46,358 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-09-08 02:27:46,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,504 INFO L375 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-09-08 02:27:46,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,565 INFO L567 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-09-08 02:27:46,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:75 [2019-09-08 02:27:46,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 72 [2019-09-08 02:27:46,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,763 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.2 percent of original size [2019-09-08 02:27:46,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:46,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-09-08 02:27:46,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:107 [2019-09-08 02:27:46,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:46,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,926 INFO L375 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 33 treesize of output 49 [2019-09-08 02:27:46,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:46,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:46,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:115, output treesize:107 [2019-09-08 02:27:47,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:47,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 124 [2019-09-08 02:27:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,121 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:27:47,207 INFO L567 ElimStorePlain]: treesize reduction 96, result has 45.8 percent of original size [2019-09-08 02:27:47,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:47,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:47,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:47,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-09-08 02:27:47,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:47,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:47,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:47,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:135 [2019-09-08 02:27:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 02:27:50,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:50,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 47 [2019-09-08 02:27:50,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 02:27:50,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 02:27:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:27:50,907 INFO L87 Difference]: Start difference. First operand 319 states and 398 transitions. Second operand 47 states. [2019-09-08 02:27:51,687 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-09-08 02:27:51,913 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-08 02:27:52,283 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 60 [2019-09-08 02:27:52,977 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-08 02:27:53,352 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-09-08 02:27:54,544 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 02:27:54,923 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-08 02:27:56,194 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-08 02:27:57,784 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 112 [2019-09-08 02:27:58,093 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2019-09-08 02:27:58,471 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-09-08 02:27:58,812 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 116 [2019-09-08 02:27:59,148 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2019-09-08 02:27:59,479 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-09-08 02:27:59,746 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2019-09-08 02:28:00,101 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2019-09-08 02:28:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:00,597 INFO L93 Difference]: Finished difference Result 440 states and 593 transitions. [2019-09-08 02:28:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:28:00,598 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 75 [2019-09-08 02:28:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:00,600 INFO L225 Difference]: With dead ends: 440 [2019-09-08 02:28:00,600 INFO L226 Difference]: Without dead ends: 412 [2019-09-08 02:28:00,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=233, Invalid=4189, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 02:28:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-08 02:28:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 281. [2019-09-08 02:28:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-08 02:28:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 354 transitions. [2019-09-08 02:28:00,663 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 354 transitions. Word has length 75 [2019-09-08 02:28:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:00,663 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 354 transitions. [2019-09-08 02:28:00,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 02:28:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 354 transitions. [2019-09-08 02:28:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 02:28:00,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:00,665 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 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, 1, 1] [2019-09-08 02:28:00,665 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:00,666 INFO L82 PathProgramCache]: Analyzing trace with hash -797137357, now seen corresponding path program 3 times [2019-09-08 02:28:00,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:00,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:00,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:28:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 02:28:01,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:01,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:28:01,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:28:01,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-08 02:28:01,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:28:01,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 02:28:01,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:01,510 INFO L375 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-09-08 02:28:01,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-09-08 02:28:01,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:28:01,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-08 02:28:01,555 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 02:28:01,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,583 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-09-08 02:28:01,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2019-09-08 02:28:01,634 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_64|], 1=[|v_#memory_$Pointer$.base_70|]} [2019-09-08 02:28:01,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:28:01,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 19 [2019-09-08 02:28:01,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,675 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2019-09-08 02:28:01,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,768 INFO L375 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-09-08 02:28:01,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,825 INFO L567 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size [2019-09-08 02:28:01,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:65 [2019-09-08 02:28:01,893 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_65|], 3=[|v_#memory_$Pointer$.base_71|]} [2019-09-08 02:28:01,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:28:01,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:01,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:01,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2019-09-08 02:28:01,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:01,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:01,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:02,020 INFO L567 ElimStorePlain]: treesize reduction 75, result has 49.0 percent of original size [2019-09-08 02:28:02,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:02,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:93 [2019-09-08 02:28:02,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:02,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:02,109 INFO L375 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 33 treesize of output 49 [2019-09-08 02:28:02,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:02,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:02,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:02,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:93 [2019-09-08 02:28:02,201 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.offset_66|], 6=[|v_#memory_$Pointer$.base_72|]} [2019-09-08 02:28:02,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:02,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2019-09-08 02:28:02,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:02,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:02,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:02,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 118 [2019-09-08 02:28:02,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:02,311 INFO L496 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-08 02:28:02,436 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 35 [2019-09-08 02:28:02,436 INFO L567 ElimStorePlain]: treesize reduction 700, result has 11.7 percent of original size [2019-09-08 02:28:02,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:02,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:112, output treesize:117 [2019-09-08 02:28:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 50 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 02:28:03,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:03,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2019-09-08 02:28:03,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:28:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:28:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:28:03,656 INFO L87 Difference]: Start difference. First operand 281 states and 354 transitions. Second operand 39 states. [2019-09-08 02:28:04,917 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2019-09-08 02:28:05,154 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-09-08 02:28:05,447 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-09-08 02:28:05,700 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2019-09-08 02:28:06,009 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 84 [2019-09-08 02:28:06,315 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 90 [2019-09-08 02:28:06,617 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 100 [2019-09-08 02:28:06,990 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 118 [2019-09-08 02:28:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:09,220 INFO L93 Difference]: Finished difference Result 327 states and 418 transitions. [2019-09-08 02:28:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 02:28:09,220 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-09-08 02:28:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:09,222 INFO L225 Difference]: With dead ends: 327 [2019-09-08 02:28:09,222 INFO L226 Difference]: Without dead ends: 320 [2019-09-08 02:28:09,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=370, Invalid=2822, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:28:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-08 02:28:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 266. [2019-09-08 02:28:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-08 02:28:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 333 transitions. [2019-09-08 02:28:09,291 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 333 transitions. Word has length 75 [2019-09-08 02:28:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:09,291 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 333 transitions. [2019-09-08 02:28:09,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:28:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 333 transitions. [2019-09-08 02:28:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 02:28:09,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:09,293 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:28:09,293 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash -568000615, now seen corresponding path program 5 times [2019-09-08 02:28:09,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:09,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:09,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:28:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:10,616 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-09-08 02:28:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 02:28:11,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:11,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:28:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:28:11,340 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:28:11,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:28:11,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-08 02:28:11,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:11,440 INFO L375 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-09-08 02:28:11,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:11,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-09-08 02:28:11,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:28:11,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:11,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:28:11,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:11,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,542 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-09-08 02:28:11,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:11,624 INFO L375 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 12 treesize of output 28 [2019-09-08 02:28:11,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,667 INFO L567 ElimStorePlain]: treesize reduction 14, result has 72.5 percent of original size [2019-09-08 02:28:11,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:37 [2019-09-08 02:28:11,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:11,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-09-08 02:28:11,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,917 INFO L567 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2019-09-08 02:28:11,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:11,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-09-08 02:28:11,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,997 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2019-09-08 02:28:11,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:11,997 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:69 [2019-09-08 02:28:12,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:44,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:44,156 INFO L375 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 2 case distinctions, treesize of input 183 treesize of output 193 [2019-09-08 02:28:44,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:44,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:44,171 INFO L375 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 178 [2019-09-08 02:28:44,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:44,470 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-08 02:28:44,470 INFO L567 ElimStorePlain]: treesize reduction 24, result has 93.0 percent of original size [2019-09-08 02:28:44,578 INFO L341 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2019-09-08 02:28:44,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 140 [2019-09-08 02:28:44,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,585 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:28:44,735 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 02:28:44,736 INFO L341 Elim1Store]: treesize reduction 30, result has 76.9 percent of original size [2019-09-08 02:28:44,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 201 [2019-09-08 02:28:44,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:44,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:44,775 INFO L496 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-08 02:28:45,249 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2019-09-08 02:28:45,249 INFO L567 ElimStorePlain]: treesize reduction 226, result has 54.2 percent of original size [2019-09-08 02:28:45,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:45,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:45,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 89 [2019-09-08 02:28:45,291 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:45,638 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-09-08 02:28:45,639 INFO L341 Elim1Store]: treesize reduction 57, result has 80.9 percent of original size [2019-09-08 02:28:45,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 171 treesize of output 359 [2019-09-08 02:28:45,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:45,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:28:45,807 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:49,027 WARN L188 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 633 DAG size of output: 80 [2019-09-08 02:28:49,027 INFO L567 ElimStorePlain]: treesize reduction 56821, result has 0.4 percent of original size [2019-09-08 02:28:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-09-08 02:28:49,030 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:367, output treesize:241 [2019-09-08 02:28:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,359 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-08 02:28:49,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:49,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:50,689 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-09-08 02:28:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:28:51,048 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-08 02:28:51,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:28:51,461 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-09-08 02:28:51,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:28:51,901 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-09-08 02:28:51,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:51,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:28:51,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:28:52,788 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2019-09-08 02:28:53,660 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2019-09-08 02:28:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 02:28:53,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:53,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2019-09-08 02:28:53,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 02:28:53,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 02:28:53,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2397, Unknown=14, NotChecked=0, Total=2550 [2019-09-08 02:28:53,787 INFO L87 Difference]: Start difference. First operand 266 states and 333 transitions. Second operand 51 states. [2019-09-08 02:29:18,044 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 02:29:37,919 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-08 02:29:38,488 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 134 [2019-09-08 02:29:54,038 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-09-08 02:30:00,529 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2019-09-08 02:30:07,214 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2019-09-08 02:30:16,935 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 285 DAG size of output: 276 [2019-09-08 02:30:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:40,754 INFO L93 Difference]: Finished difference Result 340 states and 428 transitions. [2019-09-08 02:30:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:30:40,754 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 78 [2019-09-08 02:30:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:40,756 INFO L225 Difference]: With dead ends: 340 [2019-09-08 02:30:40,756 INFO L226 Difference]: Without dead ends: 330 [2019-09-08 02:30:40,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 36 SyntacticMatches, 21 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=334, Invalid=5814, Unknown=14, NotChecked=0, Total=6162 [2019-09-08 02:30:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-08 02:30:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 274. [2019-09-08 02:30:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-08 02:30:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2019-09-08 02:30:40,832 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 78 [2019-09-08 02:30:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:40,833 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2019-09-08 02:30:40,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 02:30:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2019-09-08 02:30:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 02:30:40,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:40,834 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 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, 1] [2019-09-08 02:30:40,835 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:40,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:40,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1490334661, now seen corresponding path program 18 times [2019-09-08 02:30:40,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:40,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:40,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 02:30:40,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:40,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:40,922 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:30:40,991 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:30:40,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:40,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:30:40,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:41,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 02:30:41,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:41,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-09-08 02:30:41,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:30:41,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:30:41,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:30:41,259 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand 21 states. [2019-09-08 02:30:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:42,675 INFO L93 Difference]: Finished difference Result 699 states and 940 transitions. [2019-09-08 02:30:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 02:30:42,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-08 02:30:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:42,677 INFO L225 Difference]: With dead ends: 699 [2019-09-08 02:30:42,677 INFO L226 Difference]: Without dead ends: 512 [2019-09-08 02:30:42,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=445, Invalid=1811, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:30:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-08 02:30:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 300. [2019-09-08 02:30:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-08 02:30:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 377 transitions. [2019-09-08 02:30:42,755 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 377 transitions. Word has length 76 [2019-09-08 02:30:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:42,756 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 377 transitions. [2019-09-08 02:30:42,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:30:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 377 transitions. [2019-09-08 02:30:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 02:30:42,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:42,758 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 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, 1, 1] [2019-09-08 02:30:42,758 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -929634883, now seen corresponding path program 4 times [2019-09-08 02:30:42,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:42,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 02:30:43,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:43,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:30:43,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:30:43,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:43,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:30:43,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 15 proven. 65 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 02:30:43,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:43,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 30 [2019-09-08 02:30:43,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:30:43,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:30:43,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=808, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:30:43,534 INFO L87 Difference]: Start difference. First operand 300 states and 377 transitions. Second operand 30 states. [2019-09-08 02:30:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:45,804 INFO L93 Difference]: Finished difference Result 498 states and 668 transitions. [2019-09-08 02:30:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:30:45,809 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 76 [2019-09-08 02:30:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:45,812 INFO L225 Difference]: With dead ends: 498 [2019-09-08 02:30:45,812 INFO L226 Difference]: Without dead ends: 474 [2019-09-08 02:30:45,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=1824, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:30:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-08 02:30:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 325. [2019-09-08 02:30:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-08 02:30:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 403 transitions. [2019-09-08 02:30:45,905 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 403 transitions. Word has length 76 [2019-09-08 02:30:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:45,906 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 403 transitions. [2019-09-08 02:30:45,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:30:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 403 transitions. [2019-09-08 02:30:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 02:30:45,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:45,908 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:45,908 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1878636823, now seen corresponding path program 6 times [2019-09-08 02:30:45,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:45,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:45,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:47,734 WARN L188 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 97 [2019-09-08 02:30:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 02:30:48,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:48,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:48,585 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:30:48,643 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-08 02:30:48,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:48,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-08 02:30:48,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:48,764 INFO L375 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-09-08 02:30:48,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:48,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:48,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:48,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-09-08 02:30:48,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:30:48,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:48,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:48,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 02:30:48,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:48,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:48,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:48,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-09-08 02:30:48,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:48,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 02:30:48,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:49,017 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2019-09-08 02:30:49,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:49,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2019-09-08 02:30:49,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:30:49,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:49,284 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-09-08 02:30:49,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:49,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:30:49,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:49,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:49,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:49,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:61 [2019-09-08 02:30:50,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:50,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-09-08 02:30:50,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:50,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:50,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:50,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 58 [2019-09-08 02:30:50,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:50,303 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:30:50,369 INFO L567 ElimStorePlain]: treesize reduction 20, result has 70.6 percent of original size [2019-09-08 02:30:50,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:50,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:50,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-09-08 02:30:50,375 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:50,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:50,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:50,396 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:109, output treesize:10 [2019-09-08 02:31:23,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:23,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:23,706 INFO L375 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 2 case distinctions, treesize of input 28 treesize of output 38 [2019-09-08 02:31:23,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:23,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:23,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:23,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:23,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:23,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:23,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2019-09-08 02:31:23,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:23,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:23,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:23,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:23,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 166 [2019-09-08 02:31:23,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:31:23,956 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:31:24,106 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-08 02:31:24,106 INFO L567 ElimStorePlain]: treesize reduction 156, result has 36.1 percent of original size [2019-09-08 02:31:24,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:31:24,107 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:184, output treesize:126 [2019-09-08 02:31:31,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 02:31:34,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:31:34,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 52 [2019-09-08 02:31:34,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 02:31:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 02:31:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2494, Unknown=19, NotChecked=0, Total=2652 [2019-09-08 02:31:34,029 INFO L87 Difference]: Start difference. First operand 325 states and 403 transitions. Second operand 52 states.