/usr/bin/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-ext2-properties/simple_search_value-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:14:28,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:14:28,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:14:28,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:14:28,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:14:28,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:14:28,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:14:28,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:14:28,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:14:28,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:14:28,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:14:28,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:14:28,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:14:28,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:14:28,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:14:28,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:14:28,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:14:28,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:14:28,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:14:28,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:14:28,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:14:28,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:14:28,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:14:28,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:14:28,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:14:28,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:14:28,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:14:28,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:14:28,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:14:28,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:14:28,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:14:28,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:14:28,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:14:28,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:14:28,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:14:28,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:14:28,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:14:28,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:14:28,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:14:28,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:14:28,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:14:28,648 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-11-06 21:14:28,662 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:14:28,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:14:28,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:14:28,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:14:28,663 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:14:28,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:14:28,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:14:28,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:14:28,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:14:28,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:14:28,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:14:28,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:14:28,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:14:28,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:14:28,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:14:28,666 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:14:28,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:14:28,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:14:28,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:14:28,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:14:28,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:14:28,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:14:28,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:14:28,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:14:28,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:14:28,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:14:28,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:14:28,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:14:28,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:14:28,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:14:28,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:14:28,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:14:28,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:14:28,974 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:14:28,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-11-06 21:14:29,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbd0dedb/4506dcc03063451ea6ba09d7a92e2463/FLAGa4ef8399b [2019-11-06 21:14:29,595 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:14:29,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-11-06 21:14:29,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbd0dedb/4506dcc03063451ea6ba09d7a92e2463/FLAGa4ef8399b [2019-11-06 21:14:29,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbd0dedb/4506dcc03063451ea6ba09d7a92e2463 [2019-11-06 21:14:29,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:14:29,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:14:29,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:14:29,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:14:29,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:14:29,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:29" (1/1) ... [2019-11-06 21:14:29,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122c2fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:29, skipping insertion in model container [2019-11-06 21:14:29,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:29" (1/1) ... [2019-11-06 21:14:29,953 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:14:30,006 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:14:30,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:14:30,464 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:14:30,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:14:30,589 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:14:30,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30 WrapperNode [2019-11-06 21:14:30,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:14:30,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:14:30,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:14:30,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:14:30,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2019-11-06 21:14:30,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2019-11-06 21:14:30,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2019-11-06 21:14:30,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2019-11-06 21:14:30,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2019-11-06 21:14:30,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2019-11-06 21:14:30,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2019-11-06 21:14:30,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:14:30,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:14:30,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:14:30,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:14:30,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:14:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:14:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:14:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:14:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:14:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:14:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:14:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:14:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:14:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:14:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:14:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:14:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:14:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:14:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:14:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:14:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:14:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:14:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:14:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:14:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:14:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:14:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:14:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:14:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:14:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:14:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:14:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:14:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:14:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:14:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:14:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:14:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:14:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:14:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:14:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:14:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:14:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:14:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:14:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:14:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:14:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:14:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:14:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:14:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:14:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:14:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:14:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:14:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:14:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:14:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:14:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:14:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:14:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:14:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:14:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:14:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:14:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:14:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:14:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:14:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:14:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:14:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:14:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:14:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:14:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:14:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:14:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:14:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:14:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:14:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:14:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:14:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:14:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:14:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:14:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:14:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:14:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:14:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:14:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:14:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:14:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:14:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:14:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:14:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:14:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:14:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:14:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:14:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:14:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:14:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:14:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:14:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:14:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:14:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:14:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:14:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:14:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:14:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:14:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:14:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:14:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:14:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:14:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:14:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:14:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:14:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:14:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:14:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:14:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:14:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:14:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:14:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:14:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:14:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:14:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:14:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:14:31,081 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:14:31,241 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:14:31,241 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 21:14:31,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:31 BoogieIcfgContainer [2019-11-06 21:14:31,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:14:31,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:14:31,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:14:31,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:14:31,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:29" (1/3) ... [2019-11-06 21:14:31,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6250978c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:31, skipping insertion in model container [2019-11-06 21:14:31,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (2/3) ... [2019-11-06 21:14:31,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6250978c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:31, skipping insertion in model container [2019-11-06 21:14:31,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:31" (3/3) ... [2019-11-06 21:14:31,251 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2019-11-06 21:14:31,262 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:14:31,272 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:14:31,284 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:14:31,320 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:14:31,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:14:31,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:14:31,321 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:14:31,321 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:14:31,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:14:31,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:14:31,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:14:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-06 21:14:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-06 21:14:31,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:31,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:31,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-11-06 21:14:31,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:31,358 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408058501] [2019-11-06 21:14:31,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:31,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408058501] [2019-11-06 21:14:31,517 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:31,518 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:14:31,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764102085] [2019-11-06 21:14:31,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:14:31,524 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:31,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:14:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:14:31,544 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-11-06 21:14:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:31,662 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-11-06 21:14:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:14:31,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-06 21:14:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:31,672 INFO L225 Difference]: With dead ends: 45 [2019-11-06 21:14:31,672 INFO L226 Difference]: Without dead ends: 22 [2019-11-06 21:14:31,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:14:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-06 21:14:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-06 21:14:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-06 21:14:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-06 21:14:31,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-11-06 21:14:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:31,714 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-06 21:14:31,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:14:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-06 21:14:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:14:31,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:31,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:31,716 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-11-06 21:14:31,717 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:31,717 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795296743] [2019-11-06 21:14:31,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:31,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795296743] [2019-11-06 21:14:31,801 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:31,801 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:14:31,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155973797] [2019-11-06 21:14:31,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:14:31,803 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:14:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:14:31,804 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-11-06 21:14:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:31,905 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-11-06 21:14:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:14:31,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-06 21:14:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:31,908 INFO L225 Difference]: With dead ends: 32 [2019-11-06 21:14:31,909 INFO L226 Difference]: Without dead ends: 23 [2019-11-06 21:14:31,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:14:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-06 21:14:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-06 21:14:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-06 21:14:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-06 21:14:31,918 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-11-06 21:14:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:31,918 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-06 21:14:31,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:14:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-11-06 21:14:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:14:31,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:31,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:31,921 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-11-06 21:14:31,922 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:31,922 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225328137] [2019-11-06 21:14:31,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:32,026 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225328137] [2019-11-06 21:14:32,026 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:32,026 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:14:32,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318147979] [2019-11-06 21:14:32,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:14:32,027 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:14:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:14:32,028 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-11-06 21:14:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:32,128 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-06 21:14:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:14:32,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-06 21:14:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:32,129 INFO L225 Difference]: With dead ends: 43 [2019-11-06 21:14:32,129 INFO L226 Difference]: Without dead ends: 28 [2019-11-06 21:14:32,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:14:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-06 21:14:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-06 21:14:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-06 21:14:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-06 21:14:32,139 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-11-06 21:14:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:32,140 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-06 21:14:32,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:14:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-06 21:14:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:14:32,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:32,141 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:32,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-11-06 21:14:32,145 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:32,146 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857479189] [2019-11-06 21:14:32,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:14:32,280 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857479189] [2019-11-06 21:14:32,280 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:32,281 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:14:32,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948800006] [2019-11-06 21:14:32,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:14:32,281 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:32,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:14:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:14:32,285 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2019-11-06 21:14:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:32,364 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-11-06 21:14:32,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:14:32,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 21:14:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:32,366 INFO L225 Difference]: With dead ends: 36 [2019-11-06 21:14:32,366 INFO L226 Difference]: Without dead ends: 33 [2019-11-06 21:14:32,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:14:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-06 21:14:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-11-06 21:14:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-06 21:14:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-06 21:14:32,372 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-11-06 21:14:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:32,372 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-06 21:14:32,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:14:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-06 21:14:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:14:32,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:32,374 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:32,374 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:32,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-11-06 21:14:32,375 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:32,375 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443821221] [2019-11-06 21:14:32,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:14:32,473 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443821221] [2019-11-06 21:14:32,473 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:32,473 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:14:32,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393756393] [2019-11-06 21:14:32,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:14:32,474 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:32,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:14:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:14:32,475 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-11-06 21:14:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:32,564 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-11-06 21:14:32,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:14:32,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-06 21:14:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:32,565 INFO L225 Difference]: With dead ends: 37 [2019-11-06 21:14:32,565 INFO L226 Difference]: Without dead ends: 29 [2019-11-06 21:14:32,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:14:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-06 21:14:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-06 21:14:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-06 21:14:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-06 21:14:32,572 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-11-06 21:14:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:32,572 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-06 21:14:32,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:14:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-06 21:14:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:14:32,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:32,573 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:32,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:32,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-11-06 21:14:32,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:32,575 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803607562] [2019-11-06 21:14:32,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:32,639 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803607562] [2019-11-06 21:14:32,639 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865917047] [2019-11-06 21:14:32,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:14:32,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:32,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:32,805 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:32,806 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-06 21:14:32,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809685543] [2019-11-06 21:14:32,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:14:32,807 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:14:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:14:32,808 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-11-06 21:14:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:32,940 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-06 21:14:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:14:32,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-06 21:14:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:32,942 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:14:32,943 INFO L226 Difference]: Without dead ends: 36 [2019-11-06 21:14:32,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:14:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-06 21:14:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-06 21:14:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:14:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 21:14:32,953 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-11-06 21:14:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:32,957 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 21:14:32,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:14:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 21:14:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:14:32,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:32,958 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:33,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:33,159 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-11-06 21:14:33,160 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:33,160 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559467285] [2019-11-06 21:14:33,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:33,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559467285] [2019-11-06 21:14:33,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840106036] [2019-11-06 21:14:33,262 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:33,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:14:33,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:33,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:14:33,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:33,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:33,415 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:33,415 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-06 21:14:33,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901926417] [2019-11-06 21:14:33,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:14:33,416 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:14:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:14:33,417 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-11-06 21:14:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:33,539 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-11-06 21:14:33,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:14:33,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-06 21:14:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:33,540 INFO L225 Difference]: With dead ends: 59 [2019-11-06 21:14:33,541 INFO L226 Difference]: Without dead ends: 41 [2019-11-06 21:14:33,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:14:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-06 21:14:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-06 21:14:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 21:14:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-06 21:14:33,547 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-11-06 21:14:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:33,547 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-06 21:14:33,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:14:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-06 21:14:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:14:33,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:33,549 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:33,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:33,759 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:33,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-11-06 21:14:33,760 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:33,761 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331169408] [2019-11-06 21:14:33,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:33,844 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331169408] [2019-11-06 21:14:33,844 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742174774] [2019-11-06 21:14:33,845 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:33,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 21:14:33,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:33,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 21:14:33,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:34,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:34,014 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:34,014 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-06 21:14:34,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545306806] [2019-11-06 21:14:34,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 21:14:34,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:34,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 21:14:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:14:34,018 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2019-11-06 21:14:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:34,174 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-11-06 21:14:34,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 21:14:34,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-06 21:14:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:34,175 INFO L225 Difference]: With dead ends: 64 [2019-11-06 21:14:34,175 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 21:14:34,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:14:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 21:14:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-06 21:14:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 21:14:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-06 21:14:34,182 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-11-06 21:14:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:34,182 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-06 21:14:34,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 21:14:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-06 21:14:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:14:34,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:34,184 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:34,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:34,394 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-11-06 21:14:34,395 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:34,396 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427896930] [2019-11-06 21:14:34,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:34,526 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427896930] [2019-11-06 21:14:34,526 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756097572] [2019-11-06 21:14:34,527 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:34,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:14:34,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:34,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-06 21:14:34,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:34,723 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-11-06 21:14:34,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:34,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,806 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-11-06 21:14:34,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,844 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:14:34,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:14:34,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:14:34,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-11-06 21:14:35,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:35,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-06 21:14:35,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:35,064 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-11-06 21:14:35,089 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-06 21:14:35,090 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 66 treesize of output 40 [2019-11-06 21:14:35,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:35,131 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-11-06 21:14:35,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:35,131 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-11-06 21:14:35,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:35,201 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2019-11-06 21:14:35,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:35,252 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-11-06 21:14:35,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:35,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-11-06 21:14:35,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:35,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-11-06 21:14:35,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:35,499 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-06 21:14:35,499 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-11-06 21:14:35,568 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-06 21:14:35,569 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 143 treesize of output 95 [2019-11-06 21:14:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,579 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:35,652 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-11-06 21:14:35,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:35,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-11-06 21:14:35,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:35,781 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 161 [2019-11-06 21:14:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-06 21:14:35,914 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-11-06 21:14:35,915 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-11-06 21:14:35,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:35,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-11-06 21:14:36,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:36,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 84 [2019-11-06 21:14:36,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:36,180 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-06 21:14:36,180 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-11-06 21:14:36,181 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 227 treesize of output 155 [2019-11-06 21:14:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,207 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:36,293 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-11-06 21:14:36,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:36,296 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-11-06 21:14:36,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:36,469 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 245 [2019-11-06 21:14:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:36,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:36,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-11-06 21:14:36,746 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-11-06 21:14:36,746 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-11-06 21:14:36,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:36,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-11-06 21:14:36,840 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-11-06 21:14:36,845 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:36,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,303 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-11-06 21:14:37,303 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-11-06 21:14:37,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 317 treesize of output 361 [2019-11-06 21:14:37,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-11-06 21:14:38,212 WARN L191 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-11-06 21:14:38,213 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-11-06 21:14:38,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:38,214 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-11-06 21:14:38,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:38,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 295 treesize of output 215 [2019-11-06 21:14:38,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:38,424 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:38,492 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-11-06 21:14:38,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:38,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-11-06 21:14:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:38,541 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:38,541 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2019-11-06 21:14:38,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627798197] [2019-11-06 21:14:38,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 21:14:38,544 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 21:14:38,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:14:38,545 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 22 states. [2019-11-06 21:14:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:39,740 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-06 21:14:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-06 21:14:39,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-11-06 21:14:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:39,741 INFO L225 Difference]: With dead ends: 75 [2019-11-06 21:14:39,741 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 21:14:39,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2019-11-06 21:14:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 21:14:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-11-06 21:14:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-06 21:14:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-06 21:14:39,749 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-11-06 21:14:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:39,749 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-06 21:14:39,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 21:14:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-06 21:14:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:14:39,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:39,751 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:39,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:39,955 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-11-06 21:14:39,955 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:39,956 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789148594] [2019-11-06 21:14:39,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:40,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789148594] [2019-11-06 21:14:40,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142671796] [2019-11-06 21:14:40,134 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:40,390 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-06 21:14:40,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:40,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-06 21:14:40,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:40,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:40,413 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:40,413 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-06 21:14:40,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606919953] [2019-11-06 21:14:40,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:14:40,414 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:14:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:14:40,415 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 11 states. [2019-11-06 21:14:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:40,586 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-11-06 21:14:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 21:14:40,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-11-06 21:14:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:40,587 INFO L225 Difference]: With dead ends: 74 [2019-11-06 21:14:40,587 INFO L226 Difference]: Without dead ends: 56 [2019-11-06 21:14:40,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:14:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-06 21:14:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-06 21:14:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 21:14:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-06 21:14:40,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-11-06 21:14:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:40,595 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-06 21:14:40,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:14:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-06 21:14:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 21:14:40,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:40,597 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:40,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:40,801 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-11-06 21:14:40,802 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:40,802 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621445219] [2019-11-06 21:14:40,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:40,929 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621445219] [2019-11-06 21:14:40,929 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613166738] [2019-11-06 21:14:40,929 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:41,876 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-06 21:14:41,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:41,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 21:14:41,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:41,900 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:41,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-06 21:14:41,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562599606] [2019-11-06 21:14:41,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:14:41,901 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:14:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:14:41,902 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 12 states. [2019-11-06 21:14:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:42,082 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-11-06 21:14:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 21:14:42,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-06 21:14:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:42,084 INFO L225 Difference]: With dead ends: 79 [2019-11-06 21:14:42,084 INFO L226 Difference]: Without dead ends: 61 [2019-11-06 21:14:42,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:14:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-06 21:14:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-11-06 21:14:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 21:14:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-06 21:14:42,091 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-11-06 21:14:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:42,091 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-06 21:14:42,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:14:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-06 21:14:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-06 21:14:42,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:42,093 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:42,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:42,299 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:42,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-11-06 21:14:42,300 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:42,300 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707820629] [2019-11-06 21:14:42,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:42,452 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707820629] [2019-11-06 21:14:42,452 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133109017] [2019-11-06 21:14:42,452 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:42,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:14:42,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:42,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:42,620 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:42,620 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-06 21:14:42,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434108504] [2019-11-06 21:14:42,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:14:42,622 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:14:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:14:42,623 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 13 states. [2019-11-06 21:14:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:42,822 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-11-06 21:14:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:14:42,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-11-06 21:14:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:42,824 INFO L225 Difference]: With dead ends: 84 [2019-11-06 21:14:42,824 INFO L226 Difference]: Without dead ends: 66 [2019-11-06 21:14:42,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:14:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-06 21:14:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-06 21:14:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-06 21:14:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-06 21:14:42,831 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-11-06 21:14:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:42,832 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-06 21:14:42,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:14:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-06 21:14:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 21:14:42,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:42,833 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:43,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:43,042 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-11-06 21:14:43,043 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:43,043 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191390115] [2019-11-06 21:14:43,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:43,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191390115] [2019-11-06 21:14:43,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049165622] [2019-11-06 21:14:43,259 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:43,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:14:43,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:43,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 21:14:43,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:43,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:43,397 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:43,398 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-06 21:14:43,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702771254] [2019-11-06 21:14:43,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:14:43,398 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:43,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:14:43,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:14:43,399 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 14 states. [2019-11-06 21:14:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:43,607 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-11-06 21:14:43,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 21:14:43,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-11-06 21:14:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:43,609 INFO L225 Difference]: With dead ends: 89 [2019-11-06 21:14:43,609 INFO L226 Difference]: Without dead ends: 71 [2019-11-06 21:14:43,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:14:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-06 21:14:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-11-06 21:14:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-06 21:14:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-06 21:14:43,619 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-11-06 21:14:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:43,619 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-06 21:14:43,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:14:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-06 21:14:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 21:14:43,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:43,621 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:43,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:43,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-11-06 21:14:43,826 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:43,826 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235721784] [2019-11-06 21:14:43,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:43,987 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235721784] [2019-11-06 21:14:43,987 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993217076] [2019-11-06 21:14:43,987 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:46,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-06 21:14:46,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:46,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-06 21:14:46,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:46,635 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:46,635 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-11-06 21:14:46,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324155312] [2019-11-06 21:14:46,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:14:46,636 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:14:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:14:46,637 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 15 states. [2019-11-06 21:14:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:46,889 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-11-06 21:14:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 21:14:46,889 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-11-06 21:14:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:46,890 INFO L225 Difference]: With dead ends: 94 [2019-11-06 21:14:46,890 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 21:14:46,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2019-11-06 21:14:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 21:14:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-11-06 21:14:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-06 21:14:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-06 21:14:46,897 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-11-06 21:14:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:46,897 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-06 21:14:46,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:14:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-06 21:14:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-06 21:14:46,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:46,899 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:47,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:47,116 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-11-06 21:14:47,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:47,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76325513] [2019-11-06 21:14:47,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-06 21:14:47,629 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76325513] [2019-11-06 21:14:47,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493255668] [2019-11-06 21:14:47,630 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:47,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:14:47,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:47,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 122 conjunts are in the unsatisfiable core [2019-11-06 21:14:47,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:47,874 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-06 21:14:47,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:47,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:47,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:47,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2019-11-06 21:14:47,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:47,928 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-11-06 21:14:47,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:47,970 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-11-06 21:14:47,977 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-11-06 21:14:47,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:47,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:47,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:47,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-11-06 21:14:48,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:48,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:48,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-06 21:14:48,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,120 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 22 treesize of output 69 [2019-11-06 21:14:48,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,163 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-11-06 21:14:48,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:14:48,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,187 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-11-06 21:14:48,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:48,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:48,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-11-06 21:14:48,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-11-06 21:14:48,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,418 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-11-06 21:14:48,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-11-06 21:14:48,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:48,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-11-06 21:14:48,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:48,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:48,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-11-06 21:14:48,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 129 [2019-11-06 21:14:48,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,813 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-06 21:14:48,814 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-11-06 21:14:48,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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-11-06 21:14:48,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:48,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-11-06 21:14:48,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:48,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:48,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:48,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:48,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-11-06 21:14:49,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:49,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 159 [2019-11-06 21:14:49,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:49,358 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-06 21:14:49,359 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-11-06 21:14:49,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 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-11-06 21:14:49,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:49,486 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-06 21:14:49,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:49,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:49,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-11-06 21:14:49,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:49,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:49,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:49,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:49,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-11-06 21:14:50,012 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-06 21:14:50,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 189 [2019-11-06 21:14:50,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,323 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-06 21:14:50,323 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-11-06 21:14:50,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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-11-06 21:14:50,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,447 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-06 21:14:50,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:50,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-11-06 21:14:50,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:50,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,793 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-06 21:14:50,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:50,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-11-06 21:14:51,522 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-06 21:14:51,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:51,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 219 [2019-11-06 21:14:51,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:51,829 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-11-06 21:14:51,830 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-11-06 21:14:51,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-11-06 21:14:51,837 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:51,942 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-06 21:14:51,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:51,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:51,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-11-06 21:14:56,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:56,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,315 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-06 21:14:56,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:56,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-11-06 21:15:01,618 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-06 21:15:01,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:01,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 52 treesize of output 249 [2019-11-06 21:15:01,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:02,065 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-11-06 21:15:02,066 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-11-06 21:15:02,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 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-11-06 21:15:02,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:02,262 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-06 21:15:02,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:02,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:02,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-11-06 21:15:07,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, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:07,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:07,438 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-06 21:15:07,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:07,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:07,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200