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-fea9116 [2019-09-20 13:01:59,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:01:59,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:01:59,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:01:59,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:01:59,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:01:59,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:01:59,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:01:59,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:01:59,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:01:59,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:01:59,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:01:59,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:01:59,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:01:59,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:01:59,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:01:59,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:01:59,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:01:59,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:01:59,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:01:59,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:01:59,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:01:59,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:01:59,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:01:59,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:01:59,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:01:59,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:01:59,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:01:59,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:01:59,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:01:59,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:01:59,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:01:59,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:01:59,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:01:59,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:01:59,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:01:59,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:01:59,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:01:59,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:01:59,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:01:59,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:01:59,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:01:59,633 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:01:59,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:01:59,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:01:59,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:01:59,636 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:01:59,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:01:59,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:01:59,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:01:59,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:01:59,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:01:59,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:01:59,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:01:59,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:01:59,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:01:59,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:01:59,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:01:59,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:01:59,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:01:59,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:01:59,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:01:59,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:01:59,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:59,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:01:59,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:01:59,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:01:59,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:01:59,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:01:59,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:01:59,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:01:59,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:01:59,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:01:59,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:01:59,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:01:59,723 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:01:59,724 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-09-20 13:01:59,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d408f3bc0/23d81f7f100c461d8554ce37cdc4fd5b/FLAGdd08582b0 [2019-09-20 13:02:00,335 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:02:00,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-09-20 13:02:00,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d408f3bc0/23d81f7f100c461d8554ce37cdc4fd5b/FLAGdd08582b0 [2019-09-20 13:02:00,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d408f3bc0/23d81f7f100c461d8554ce37cdc4fd5b [2019-09-20 13:02:00,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:02:00,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:02:00,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:00,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:02:00,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:02:00,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f684b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00, skipping insertion in model container [2019-09-20 13:02:00,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,681 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:02:00,730 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:02:01,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:01,295 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:02:01,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:01,394 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:02:01,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01 WrapperNode [2019-09-20 13:02:01,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:01,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:02:01,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:02:01,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:02:01,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... [2019-09-20 13:02:01,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... [2019-09-20 13:02:01,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... [2019-09-20 13:02:01,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... [2019-09-20 13:02:01,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... [2019-09-20 13:02:01,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... [2019-09-20 13:02:01,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... [2019-09-20 13:02:01,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:02:01,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:02:01,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:02:01,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:02:01,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:02:01,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:02:01,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:02:01,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:02:01,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:02:01,541 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-20 13:02:01,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:02:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:02:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:02:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:02:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:02:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:02:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:02:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:02:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:02:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:02:01,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:02:01,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:02:01,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:02:01,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:02:01,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:02:01,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:02:01,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:02:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:02:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:02:01,549 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:02:01,549 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:02:01,549 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:02:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:02:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:02:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:02:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:02:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:02:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:02:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:02:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:02:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:02:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:02:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:02:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:02:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:02:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:02:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:02:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:02:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:02:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:02:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:02:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:02:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:02:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:02:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:02:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:02:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:02:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:02:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:02:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:02:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:02:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:02:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:02:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:02:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:02:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:02:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:02:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:02:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:02:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:02:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:02:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:02:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:02:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:02:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:02:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:02:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:02:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:02:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:02:01,559 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:02:01,559 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:02:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:02:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:02:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:02:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:02:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:02:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:02:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:02:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:02:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:02:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:02:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:02:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:02:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:02:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:02:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:02:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:02:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:02:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:02:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:02:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:02:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:02:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:02:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:02:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:02:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:02:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:02:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:02:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:02:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:02:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:02:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-20 13:02:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:02:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:02:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:02:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:02:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:02:01,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:02:01,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:02:01,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:02:01,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:02:01,918 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-20 13:02:02,090 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:02:02,091 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 13:02:02,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:02 BoogieIcfgContainer [2019-09-20 13:02:02,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:02:02,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:02:02,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:02:02,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:02:02,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:02:00" (1/3) ... [2019-09-20 13:02:02,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369b3ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:02, skipping insertion in model container [2019-09-20 13:02:02,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:01" (2/3) ... [2019-09-20 13:02:02,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369b3ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:02, skipping insertion in model container [2019-09-20 13:02:02,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:02" (3/3) ... [2019-09-20 13:02:02,101 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2019-09-20 13:02:02,111 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:02:02,120 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:02:02,137 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:02:02,165 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:02:02,166 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:02:02,166 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:02:02,166 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:02:02,166 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:02:02,166 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:02:02,167 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:02:02,167 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:02:02,167 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:02:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-20 13:02:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:02:02,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,189 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,191 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-09-20 13:02:02,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:02,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:02,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:02:02,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:02:02,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:02:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:02,367 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-20 13:02:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,399 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-09-20 13:02:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:02:02,401 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-20 13:02:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,411 INFO L225 Difference]: With dead ends: 45 [2019-09-20 13:02:02,412 INFO L226 Difference]: Without dead ends: 22 [2019-09-20 13:02:02,418 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-20 13:02:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-20 13:02:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-20 13:02:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-20 13:02:02,453 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-09-20 13:02:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,453 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-20 13:02:02,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:02:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-20 13:02:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:02:02,455 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,455 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,455 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-09-20 13:02:02,456 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:02,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:02,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:02:02,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:02:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:02:02,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:02:02,523 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-09-20 13:02:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,556 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-09-20 13:02:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:02:02,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-20 13:02:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,558 INFO L225 Difference]: With dead ends: 32 [2019-09-20 13:02:02,559 INFO L226 Difference]: Without dead ends: 23 [2019-09-20 13:02:02,560 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:02:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-20 13:02:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-20 13:02:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 13:02:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-20 13:02:02,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-09-20 13:02:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,565 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-20 13:02:02,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:02:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-20 13:02:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:02:02,566 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,567 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,567 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-09-20 13:02:02,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:02,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:02,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:02:02,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:02:02,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:02:02,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:02:02,627 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-09-20 13:02:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,679 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-20 13:02:02,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:02,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-20 13:02:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,680 INFO L225 Difference]: With dead ends: 43 [2019-09-20 13:02:02,681 INFO L226 Difference]: Without dead ends: 28 [2019-09-20 13:02:02,681 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-20 13:02:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-09-20 13:02:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 13:02:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-20 13:02:02,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-20 13:02:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,687 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-20 13:02:02,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:02:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-20 13:02:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:02:02,688 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,689 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,689 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,690 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-09-20 13:02:02,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:02:02,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:02,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:02:02,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:02:02,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:02:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:02:02,832 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2019-09-20 13:02:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,931 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-20 13:02:02,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:02:02,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-20 13:02:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,933 INFO L225 Difference]: With dead ends: 36 [2019-09-20 13:02:02,934 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 13:02:02,935 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 13:02:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-20 13:02:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-20 13:02:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-20 13:02:02,940 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-09-20 13:02:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,941 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-20 13:02:02,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:02:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-20 13:02:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:02:02,942 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,942 INFO L407 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-09-20 13:02:02,942 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-09-20 13:02:02,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:02:03,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:03,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:02:03,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:02:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:02:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:03,024 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-09-20 13:02:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:03,115 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-20 13:02:03,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:03,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-20 13:02:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:03,116 INFO L225 Difference]: With dead ends: 37 [2019-09-20 13:02:03,116 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 13:02:03,117 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-20 13:02:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 13:02:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-20 13:02:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-20 13:02:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-20 13:02:03,123 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-09-20 13:02:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:03,123 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-20 13:02:03,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:02:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-20 13:02:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:02:03,124 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:03,124 INFO L407 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-09-20 13:02:03,125 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:03,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-09-20 13:02:03,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:03,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:03,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:03,196 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 13:02:03,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:03,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-20 13:02:03,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:02:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:02:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:03,399 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-20 13:02:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:03,481 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-20 13:02:03,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:02:03,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-20 13:02:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:03,483 INFO L225 Difference]: With dead ends: 54 [2019-09-20 13:02:03,483 INFO L226 Difference]: Without dead ends: 36 [2019-09-20 13:02:03,484 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:02:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-20 13:02:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-09-20 13:02:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-20 13:02:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-20 13:02:03,489 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-09-20 13:02:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:03,490 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-20 13:02:03,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:02:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-20 13:02:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:02:03,491 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:03,491 INFO L407 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-09-20 13:02:03,491 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:03,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-09-20 13:02:03,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:03,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:03,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:03,565 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:03,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:03,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:03,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:03,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 13:02:03,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:03,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:03,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-20 13:02:03,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:02:03,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:02:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:02:03,719 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-20 13:02:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:03,816 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-09-20 13:02:03,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:02:03,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-20 13:02:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:03,819 INFO L225 Difference]: With dead ends: 59 [2019-09-20 13:02:03,819 INFO L226 Difference]: Without dead ends: 41 [2019-09-20 13:02:03,819 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:02:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-20 13:02:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-09-20 13:02:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:02:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-20 13:02:03,826 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-09-20 13:02:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:03,826 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-20 13:02:03,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:02:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-20 13:02:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:02:03,828 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:03,828 INFO L407 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-09-20 13:02:03,828 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:03,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:03,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-09-20 13:02:03,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:03,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:03,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:03,922 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:02:04,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:02:04,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:04,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 13:02:04,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:04,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:04,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:04,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-20 13:02:04,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:02:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:02:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:02:04,115 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 8 states. [2019-09-20 13:02:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:04,239 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-20 13:02:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:02:04,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-20 13:02:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:04,241 INFO L225 Difference]: With dead ends: 64 [2019-09-20 13:02:04,241 INFO L226 Difference]: Without dead ends: 46 [2019-09-20 13:02:04,242 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:02:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-20 13:02:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-20 13:02:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:02:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-20 13:02:04,256 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-09-20 13:02:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:04,257 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-20 13:02:04,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:02:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-20 13:02:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:02:04,259 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:04,259 INFO L407 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-09-20 13:02:04,260 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:04,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-09-20 13:02:04,261 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:04,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:04,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:04,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:04,376 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:04,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:02:04,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:02:04,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:04,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-20 13:02:04,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:04,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:04,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:04,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:04,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,657 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:02:04,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:02:04,722 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-09-20 13:02:04,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-09-20 13:02:04,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,834 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-09-20 13:02:04,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,904 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-09-20 13:02:04,934 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-20 13:02:04,935 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-09-20 13:02:04,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,977 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-09-20 13:02:04,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-09-20 13:02:05,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,083 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-09-20 13:02:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,142 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-09-20 13:02:05,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:05,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-09-20 13:02:05,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,325 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-09-20 13:02:05,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,431 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-20 13:02:05,432 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-09-20 13:02:05,495 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-09-20 13:02:05,496 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-09-20 13:02:05,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,505 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:05,568 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-09-20 13:02:05,569 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-09-20 13:02:05,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-09-20 13:02:05,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,687 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-09-20 13:02:05,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:05,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:05,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-09-20 13:02:05,817 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-20 13:02:05,818 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-09-20 13:02:05,820 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-09-20 13:02:05,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-09-20 13:02:05,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,923 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-09-20 13:02:05,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,096 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-20 13:02:06,097 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-09-20 13:02:06,098 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-09-20 13:02:06,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,124 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:06,220 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-09-20 13:02:06,222 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-09-20 13:02:06,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-09-20 13:02:06,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,374 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-09-20 13:02:06,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:06,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-09-20 13:02:06,642 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-20 13:02:06,642 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-09-20 13:02:06,644 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-09-20 13:02:06,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-09-20 13:02:06,721 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-09-20 13:02:06,728 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:06,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,211 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-09-20 13:02:07,211 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-09-20 13:02:07,212 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-09-20 13:02:07,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,328 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-09-20 13:02:08,104 WARN L191 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-09-20 13:02:08,104 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-09-20 13:02:08,106 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-09-20 13:02:08,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-09-20 13:02:08,266 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,266 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-09-20 13:02:08,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,319 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:08,391 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-09-20 13:02:08,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-09-20 13:02:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:08,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:08,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-09-20 13:02:08,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:02:08,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:02:08,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:02:08,456 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 21 states. [2019-09-20 13:02:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:09,560 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-09-20 13:02:09,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:02:09,560 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-20 13:02:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:09,561 INFO L225 Difference]: With dead ends: 75 [2019-09-20 13:02:09,562 INFO L226 Difference]: Without dead ends: 57 [2019-09-20 13:02:09,564 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-09-20 13:02:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-20 13:02:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-09-20 13:02:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-20 13:02:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-20 13:02:09,573 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-09-20 13:02:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:09,574 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-20 13:02:09,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:02:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-20 13:02:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:02:09,575 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:09,575 INFO L407 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-09-20 13:02:09,575 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-09-20 13:02:09,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:09,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:09,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:09,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:09,686 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:09,761 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 13:02:09,931 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-20 13:02:09,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:09,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 13:02:09,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:09,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:09,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:09,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-20 13:02:09,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:02:09,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:02:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:02:09,969 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2019-09-20 13:02:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:10,093 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-09-20 13:02:10,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:02:10,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-20 13:02:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:10,095 INFO L225 Difference]: With dead ends: 74 [2019-09-20 13:02:10,095 INFO L226 Difference]: Without dead ends: 56 [2019-09-20 13:02:10,096 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:02:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-20 13:02:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-09-20 13:02:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-20 13:02:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-20 13:02:10,102 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-09-20 13:02:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:10,102 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-20 13:02:10,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:02:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-20 13:02:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:02:10,103 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:10,103 INFO L407 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-09-20 13:02:10,104 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-09-20 13:02:10,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:10,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:10,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:10,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 13:02:11,504 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-20 13:02:11,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:11,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:02:11,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:11,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:11,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:11,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-20 13:02:11,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:02:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:02:11,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:02:11,540 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 11 states. [2019-09-20 13:02:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:11,714 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-09-20 13:02:11,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:02:11,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-20 13:02:11,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:11,716 INFO L225 Difference]: With dead ends: 79 [2019-09-20 13:02:11,716 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 13:02:11,720 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:02:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 13:02:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-09-20 13:02:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 13:02:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-20 13:02:11,732 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-09-20 13:02:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:11,736 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-20 13:02:11,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:02:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-20 13:02:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:02:11,737 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:11,737 INFO L407 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-09-20 13:02:11,737 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-09-20 13:02:11,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:11,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:11,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:11,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:11,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:11,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:11,852 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:11,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:11,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 13:02:11,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:12,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:12,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-20 13:02:12,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:02:12,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:02:12,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:02:12,027 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 12 states. [2019-09-20 13:02:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:12,178 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-20 13:02:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:02:12,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-20 13:02:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:12,182 INFO L225 Difference]: With dead ends: 84 [2019-09-20 13:02:12,183 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 13:02:12,183 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:02:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 13:02:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-20 13:02:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-20 13:02:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-20 13:02:12,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-09-20 13:02:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:12,190 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-20 13:02:12,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:02:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-20 13:02:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:02:12,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:12,191 INFO L407 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-09-20 13:02:12,191 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-09-20 13:02:12,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:12,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:12,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:12,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:12,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:12,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:12,312 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:12,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:12,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:12,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:12,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 13:02:12,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:12,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:12,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:12,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-20 13:02:12,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:02:12,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:02:12,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:02:12,518 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 13 states. [2019-09-20 13:02:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:12,694 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-09-20 13:02:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:02:12,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-20 13:02:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:12,696 INFO L225 Difference]: With dead ends: 89 [2019-09-20 13:02:12,696 INFO L226 Difference]: Without dead ends: 71 [2019-09-20 13:02:12,697 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:02:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-20 13:02:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-09-20 13:02:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-20 13:02:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-20 13:02:12,714 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-09-20 13:02:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:12,715 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-20 13:02:12,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:02:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-20 13:02:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:02:12,716 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:12,717 INFO L407 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-09-20 13:02:12,717 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-09-20 13:02:12,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:12,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:12,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:12,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:12,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:12,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:12,912 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:12,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:02:15,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-20 13:02:15,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:15,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-20 13:02:15,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:15,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:15,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-20 13:02:15,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:02:15,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:02:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:02:15,826 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2019-09-20 13:02:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:16,017 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-09-20 13:02:16,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:02:16,018 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-20 13:02:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:16,019 INFO L225 Difference]: With dead ends: 94 [2019-09-20 13:02:16,019 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:02:16,020 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:02:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:02:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-09-20 13:02:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-20 13:02:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-20 13:02:16,031 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-09-20 13:02:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:16,032 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-20 13:02:16,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:02:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-20 13:02:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:02:16,033 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:16,033 INFO L407 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-09-20 13:02:16,033 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-09-20 13:02:16,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:16,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-20 13:02:16,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:16,663 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:16,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:02:17,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:02:17,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:17,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-20 13:02:17,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:17,075 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-09-20 13:02:17,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2019-09-20 13:02:17,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:17,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,162 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-09-20 13:02:17,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:17,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,184 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-09-20 13:02:17,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-09-20 13:02:17,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:17,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, 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-09-20 13:02:17,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-09-20 13:02:17,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,348 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-09-20 13:02:17,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,398 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-09-20 13:02:17,403 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-09-20 13:02:17,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,420 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-09-20 13:02:17,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-09-20 13:02:17,464 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-09-20 13:02:17,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:17,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-09-20 13:02:17,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,576 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-09-20 13:02:17,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,651 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-09-20 13:02:17,656 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-09-20 13:02:17,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,688 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-09-20 13:02:17,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-09-20 13:02:17,742 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-09-20 13:02:17,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:17,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,766 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-09-20 13:02:17,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-09-20 13:02:17,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:17,893 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-09-20 13:02:17,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,010 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-20 13:02:18,011 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-09-20 13:02:18,018 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-09-20 13:02:18,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,060 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-09-20 13:02:18,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-09-20 13:02:18,125 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-09-20 13:02:18,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,162 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-09-20 13:02:18,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-09-20 13:02:18,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,329 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-09-20 13:02:18,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,538 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-20 13:02:18,539 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-09-20 13:02:18,548 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-09-20 13:02:18,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,638 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-09-20 13:02:18,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-09-20 13:02:18,770 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-09-20 13:02:18,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,833 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-09-20 13:02:18,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-09-20 13:02:19,111 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-20 13:02:19,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:19,112 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-09-20 13:02:19,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:19,462 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-20 13:02:19,463 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-09-20 13:02:19,477 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-09-20 13:02:19,478 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:19,608 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-09-20 13:02:19,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:19,611 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-09-20 13:02:19,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-09-20 13:02:20,282 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-09-20 13:02:20,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,406 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-09-20 13:02:20,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,409 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-09-20 13:02:20,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-09-20 13:02:21,073 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-20 13:02:21,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,074 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-09-20 13:02:21,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,545 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-20 13:02:21,546 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-09-20 13:02:21,556 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-09-20 13:02:21,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,739 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-20 13:02:21,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,742 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-09-20 13:02:21,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-09-20 13:02:23,996 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-09-20 13:02:23,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,107 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-20 13:02:24,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,109 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-09-20 13:02:24,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-09-20 13:02:31,960 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-09-20 13:02:31,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,961 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-09-20 13:02:31,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:32,369 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-09-20 13:02:32,369 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-09-20 13:02:32,380 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-09-20 13:02:32,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:32,546 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-20 13:02:32,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:32,548 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-09-20 13:02:32,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200