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-112bae1 [2019-09-08 01:46:38,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:46:38,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:46:38,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:46:38,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:46:38,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:46:38,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:46:38,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:46:38,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:46:38,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:46:38,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:46:38,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:46:38,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:46:38,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:46:38,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:46:38,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:46:38,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:46:38,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:46:38,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:46:38,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:46:38,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:46:38,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:46:38,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:46:38,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:46:38,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:46:38,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:46:38,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:46:38,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:46:38,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:46:38,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:46:38,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:46:38,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:46:38,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:46:38,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:46:38,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:46:38,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:46:38,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:46:38,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:46:38,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:46:38,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:46:38,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:46:38,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:46:38,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:46:38,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:46:38,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:46:38,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:46:38,689 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:46:38,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:46:38,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:46:38,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:46:38,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:46:38,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:46:38,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:46:38,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:46:38,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:46:38,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:46:38,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:46:38,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:46:38,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:46:38,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:46:38,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:46:38,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:46:38,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:46:38,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:46:38,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:46:38,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:46:38,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:46:38,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:46:38,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:46:38,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:46:38,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:46:38,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:46:38,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:46:38,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:46:38,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:46:38,740 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:46:38,741 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-08 01:46:38,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a9640d7/43455a27c419481fbdbd5e6f98de6289/FLAG2b352c07e [2019-09-08 01:46:39,342 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:46:39,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-09-08 01:46:39,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a9640d7/43455a27c419481fbdbd5e6f98de6289/FLAG2b352c07e [2019-09-08 01:46:39,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a9640d7/43455a27c419481fbdbd5e6f98de6289 [2019-09-08 01:46:39,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:46:39,703 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:46:39,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:46:39,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:46:39,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:46:39,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:46:39" (1/1) ... [2019-09-08 01:46:39,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:39, skipping insertion in model container [2019-09-08 01:46:39,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:46:39" (1/1) ... [2019-09-08 01:46:39,720 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:46:39,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:46:40,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:46:40,234 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:46:40,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:46:40,337 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:46:40,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40 WrapperNode [2019-09-08 01:46:40,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:46:40,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:46:40,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:46:40,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:46:40,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... [2019-09-08 01:46:40,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... [2019-09-08 01:46:40,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... [2019-09-08 01:46:40,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... [2019-09-08 01:46:40,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... [2019-09-08 01:46:40,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... [2019-09-08 01:46:40,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... [2019-09-08 01:46:40,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:46:40,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:46:40,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:46:40,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:46:40,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:46:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:46:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:46:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 01:46:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 01:46:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-08 01:46:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:46:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:46:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:46:40,488 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 01:46:40,488 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 01:46:40,489 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 01:46:40,489 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 01:46:40,489 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 01:46:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 01:46:40,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 01:46:40,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 01:46:40,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 01:46:40,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 01:46:40,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 01:46:40,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 01:46:40,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 01:46:40,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 01:46:40,493 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 01:46:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 01:46:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 01:46:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 01:46:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 01:46:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 01:46:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 01:46:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 01:46:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 01:46:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 01:46:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 01:46:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 01:46:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 01:46:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 01:46:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 01:46:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 01:46:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 01:46:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 01:46:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 01:46:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 01:46:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 01:46:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 01:46:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 01:46:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 01:46:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 01:46:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 01:46:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 01:46:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 01:46:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 01:46:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 01:46:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 01:46:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 01:46:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 01:46:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 01:46:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 01:46:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 01:46:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 01:46:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 01:46:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 01:46:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 01:46:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 01:46:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 01:46:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 01:46:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 01:46:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 01:46:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 01:46:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 01:46:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 01:46:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 01:46:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 01:46:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 01:46:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 01:46:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 01:46:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 01:46:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 01:46:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 01:46:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 01:46:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 01:46:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 01:46:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 01:46:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 01:46:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 01:46:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 01:46:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 01:46:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 01:46:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 01:46:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 01:46:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 01:46:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 01:46:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 01:46:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 01:46:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 01:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 01:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 01:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 01:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 01:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 01:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 01:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 01:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 01:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 01:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 01:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 01:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 01:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 01:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 01:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 01:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 01:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 01:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 01:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 01:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-08 01:46:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:46:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 01:46:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:46:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:46:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:46:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:46:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:46:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:46:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:46:40,856 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-08 01:46:40,989 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:46:40,989 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 01:46:40,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:46:40 BoogieIcfgContainer [2019-09-08 01:46:40,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:46:40,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:46:40,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:46:40,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:46:40,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:46:39" (1/3) ... [2019-09-08 01:46:40,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4333f6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:46:40, skipping insertion in model container [2019-09-08 01:46:40,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:46:40" (2/3) ... [2019-09-08 01:46:40,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4333f6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:46:40, skipping insertion in model container [2019-09-08 01:46:40,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:46:40" (3/3) ... [2019-09-08 01:46:40,999 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2019-09-08 01:46:41,010 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:46:41,018 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:46:41,036 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:46:41,067 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:46:41,068 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:46:41,068 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:46:41,068 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:46:41,069 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:46:41,069 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:46:41,069 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:46:41,069 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:46:41,069 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:46:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-08 01:46:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 01:46:41,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:41,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:46:41,099 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-09-08 01:46:41,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:41,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:41,245 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-08 01:46:41,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:46:41,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:46:41,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:46:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:46:41,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:46:41,264 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-08 01:46:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:41,285 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-09-08 01:46:41,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:46:41,287 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-08 01:46:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:41,296 INFO L225 Difference]: With dead ends: 45 [2019-09-08 01:46:41,296 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:46:41,299 INFO L628 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-08 01:46:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:46:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 01:46:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 01:46:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-08 01:46:41,338 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-09-08 01:46:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:41,339 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-08 01:46:41,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:46:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-08 01:46:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 01:46:41,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:41,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:46:41,340 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-09-08 01:46:41,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:41,401 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-08 01:46:41,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:46:41,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:46:41,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:46:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:46:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:46:41,404 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-09-08 01:46:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:41,443 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-09-08 01:46:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:46:41,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-08 01:46:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:41,445 INFO L225 Difference]: With dead ends: 32 [2019-09-08 01:46:41,445 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 01:46:41,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:46:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 01:46:41,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 01:46:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:46:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-08 01:46:41,452 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-09-08 01:46:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:41,453 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-08 01:46:41,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:46:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-08 01:46:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 01:46:41,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:41,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:46:41,454 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:41,454 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-09-08 01:46:41,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:41,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:41,499 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-08 01:46:41,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:46:41,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:46:41,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:46:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:46:41,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:46:41,501 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-09-08 01:46:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:41,545 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-08 01:46:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:46:41,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-08 01:46:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:41,547 INFO L225 Difference]: With dead ends: 43 [2019-09-08 01:46:41,547 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:46:41,547 INFO L628 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-08 01:46:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:46:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-09-08 01:46:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 01:46:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-08 01:46:41,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-08 01:46:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:41,553 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-08 01:46:41,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:46:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-08 01:46:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:46:41,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:41,554 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:46:41,554 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-09-08 01:46:41,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:41,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:41,655 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-08 01:46:41,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:46:41,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:46:41,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:46:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:46:41,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:46:41,657 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2019-09-08 01:46:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:41,710 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-08 01:46:41,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:46:41,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-08 01:46:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:41,712 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:46:41,712 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 01:46:41,713 INFO L628 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-08 01:46:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 01:46:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-08 01:46:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 01:46:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-08 01:46:41,718 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-09-08 01:46:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:41,719 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-08 01:46:41,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:46:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-08 01:46:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:46:41,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:41,720 INFO L399 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-08 01:46:41,721 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-09-08 01:46:41,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:41,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:41,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:41,798 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-08 01:46:41,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:46:41,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:46:41,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:46:41,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:46:41,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:46:41,800 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-09-08 01:46:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:41,860 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-08 01:46:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:46:41,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-08 01:46:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:41,862 INFO L225 Difference]: With dead ends: 37 [2019-09-08 01:46:41,862 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 01:46:41,863 INFO L628 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-08 01:46:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 01:46:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-08 01:46:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 01:46:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-08 01:46:41,868 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-09-08 01:46:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:41,868 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-08 01:46:41,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:46:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-08 01:46:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:46:41,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:41,869 INFO L399 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-08 01:46:41,870 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:41,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-09-08 01:46:41,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:41,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:41,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:41,951 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-08 01:46:41,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:41,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:41,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:42,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:46:42,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:42,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:42,085 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): Stream closed [2019-09-08 01:46:42,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:42,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 01:46:42,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:46:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:46:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:46:42,093 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-08 01:46:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:42,180 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-08 01:46:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:46:42,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-08 01:46:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:42,183 INFO L225 Difference]: With dead ends: 54 [2019-09-08 01:46:42,183 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:46:42,185 INFO L628 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-08 01:46:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:46:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-09-08 01:46:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:46:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-08 01:46:42,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-09-08 01:46:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:42,195 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-08 01:46:42,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:46:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-08 01:46:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:46:42,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:42,200 INFO L399 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-08 01:46:42,200 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-09-08 01:46:42,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:42,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:42,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:42,277 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-08 01:46:42,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:42,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:46:42,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:42,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:46:42,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:42,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:46:42,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:42,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:42,372 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-08 01:46:42,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:42,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 01:46:42,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:46:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:46:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:46:42,386 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-08 01:46:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:42,473 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-09-08 01:46:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:46:42,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-08 01:46:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:42,475 INFO L225 Difference]: With dead ends: 59 [2019-09-08 01:46:42,475 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 01:46:42,476 INFO L628 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-08 01:46:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 01:46:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-09-08 01:46:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 01:46:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-08 01:46:42,482 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-09-08 01:46:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:42,482 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-08 01:46:42,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:46:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-08 01:46:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 01:46:42,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:42,483 INFO L399 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-08 01:46:42,484 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-09-08 01:46:42,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:42,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:42,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:42,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:46:42,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:42,587 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-08 01:46:42,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:42,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:46:42,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:46:42,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:42,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:46:42,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:42,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:42,707 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-08 01:46:42,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 01:46:42,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:46:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:46:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:46:42,718 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 8 states. [2019-09-08 01:46:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:42,823 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-08 01:46:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:46:42,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-08 01:46:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:42,825 INFO L225 Difference]: With dead ends: 64 [2019-09-08 01:46:42,825 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 01:46:42,826 INFO L628 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-08 01:46:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 01:46:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-08 01:46:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:46:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-08 01:46:42,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-09-08 01:46:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:42,833 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-08 01:46:42,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:46:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-08 01:46:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:46:42,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:42,834 INFO L399 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-08 01:46:42,835 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-09-08 01:46:42,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:42,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:42,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:42,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:46:42,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:42,930 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-08 01:46:42,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:42,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:46:43,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:46:43,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:43,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:46:43,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:43,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-08 01:46:43,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:43,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 01:46:43,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:43,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 01:46:43,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,213 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-08 01:46:43,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-08 01:46:43,294 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-08 01:46:43,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:43,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-09-08 01:46:43,392 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:43,393 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-08 01:46:43,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,456 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-09-08 01:46:43,489 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-08 01:46:43,489 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-08 01:46:43,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,536 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-09-08 01:46:43,536 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-08 01:46:43,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-09-08 01:46:43,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:43,614 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-08 01:46:43,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:43,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,670 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-09-08 01:46:43,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:46:43,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-09-08 01:46:43,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:43,803 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-08 01:46:43,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:43,911 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 01:46:43,912 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-09-08 01:46:43,992 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-09-08 01:46:43,992 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-08 01:46:43,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:43,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:43,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:43,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,003 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:46:44,069 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-09-08 01:46:44,071 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-08 01:46:44,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-09-08 01:46:44,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:44,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 01:46:44,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-09-08 01:46:44,344 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 01:46:44,345 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-09-08 01:46:44,348 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-08 01:46:44,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-09-08 01:46:44,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:44,489 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-08 01:46:44,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:44,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:44,643 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 01:46:44,644 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-09-08 01:46:44,645 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-08 01:46:44,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,671 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:46:44,786 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-08 01:46:44,786 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-09-08 01:46:44,788 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-08 01:46:44,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-09-08 01:46:44,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:44,944 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-08 01:46:44,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-09-08 01:46:45,193 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-08 01:46:45,194 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-09-08 01:46:45,196 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-08 01:46:45,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-09-08 01:46:45,270 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-09-08 01:46:45,276 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:46:45,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:45,747 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-09-08 01:46:45,747 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-09-08 01:46:45,748 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-08 01:46:45,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:45,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:46:45,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-09-08 01:46:46,599 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-09-08 01:46:46,599 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-09-08 01:46:46,601 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-08 01:46:46,601 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-09-08 01:46:46,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:46,767 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-08 01:46:46,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:46,822 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-08 01:46:46,921 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-09-08 01:46:46,922 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-08 01:46:46,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-09-08 01:46:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:46:46,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:46,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-09-08 01:46:46,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:46:46,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:46:46,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:46:46,974 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 21 states. [2019-09-08 01:46:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:48,184 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-09-08 01:46:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:46:48,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-08 01:46:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:48,186 INFO L225 Difference]: With dead ends: 75 [2019-09-08 01:46:48,186 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 01:46:48,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:46:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 01:46:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-09-08 01:46:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 01:46:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-08 01:46:48,194 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-09-08 01:46:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:48,195 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-08 01:46:48,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:46:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-08 01:46:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 01:46:48,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:48,196 INFO L399 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-08 01:46:48,197 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-09-08 01:46:48,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:48,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:48,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:46:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:48,277 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-08 01:46:48,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:48,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:48,301 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:46:48,492 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:46:48,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:48,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:46:48,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:48,517 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-08 01:46:48,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:48,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 01:46:48,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:46:48,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:46:48,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:46:48,524 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2019-09-08 01:46:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:48,632 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-09-08 01:46:48,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:46:48,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-08 01:46:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:48,634 INFO L225 Difference]: With dead ends: 74 [2019-09-08 01:46:48,635 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 01:46:48,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:46:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 01:46:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-09-08 01:46:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 01:46:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-08 01:46:48,641 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-09-08 01:46:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:48,642 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-08 01:46:48,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:46:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-08 01:46:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 01:46:48,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:48,643 INFO L399 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-08 01:46:48,644 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-09-08 01:46:48,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:48,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:48,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:46:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:48,754 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-08 01:46:48,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:48,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:46:48,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:49,557 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:46:49,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:49,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:46:49,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:49,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:46:49,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:49,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 01:46:49,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:46:49,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:46:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:46:49,592 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 11 states. [2019-09-08 01:46:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:49,726 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-09-08 01:46:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:46:49,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-08 01:46:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:49,728 INFO L225 Difference]: With dead ends: 79 [2019-09-08 01:46:49,728 INFO L226 Difference]: Without dead ends: 61 [2019-09-08 01:46:49,729 INFO L628 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-08 01:46:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-08 01:46:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-09-08 01:46:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 01:46:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-08 01:46:49,735 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-09-08 01:46:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:49,736 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-08 01:46:49,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:46:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-08 01:46:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 01:46:49,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:49,737 INFO L399 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-08 01:46:49,737 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-09-08 01:46:49,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:49,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:49,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:46:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:49,869 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-08 01:46:49,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:49,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:49,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:46:49,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:49,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:49,950 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-08 01:46:49,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:49,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 01:46:49,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:46:49,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:46:49,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:46:49,960 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 12 states. [2019-09-08 01:46:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:50,091 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-08 01:46:50,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:46:50,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-08 01:46:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:50,093 INFO L225 Difference]: With dead ends: 84 [2019-09-08 01:46:50,093 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 01:46:50,094 INFO L628 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-08 01:46:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 01:46:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-08 01:46:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 01:46:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-08 01:46:50,100 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-09-08 01:46:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:50,101 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-08 01:46:50,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:46:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-08 01:46:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 01:46:50,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:50,102 INFO L399 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-08 01:46:50,102 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-09-08 01:46:50,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:50,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:50,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:46:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:50,226 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-08 01:46:50,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:50,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:46:50,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:50,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:46:50,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:50,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:46:50,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:50,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:50,340 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-08 01:46:50,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:50,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 01:46:50,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:46:50,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:46:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:46:50,357 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 13 states. [2019-09-08 01:46:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:50,502 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-09-08 01:46:50,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:46:50,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-08 01:46:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:50,504 INFO L225 Difference]: With dead ends: 89 [2019-09-08 01:46:50,504 INFO L226 Difference]: Without dead ends: 71 [2019-09-08 01:46:50,505 INFO L628 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-08 01:46:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-08 01:46:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-09-08 01:46:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 01:46:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-08 01:46:50,512 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-09-08 01:46:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:50,512 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-08 01:46:50,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:46:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-08 01:46:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 01:46:50,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:50,514 INFO L399 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-08 01:46:50,514 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-09-08 01:46:50,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:50,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:46:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:50,661 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-08 01:46:50,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:50,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:46:50,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:53,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:46:53,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:53,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:46:53,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:46:53,257 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-08 01:46:53,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:46:53,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 01:46:53,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:46:53,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:46:53,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:46:53,267 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2019-09-08 01:46:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:46:53,436 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-09-08 01:46:53,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:46:53,437 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-08 01:46:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:46:53,439 INFO L225 Difference]: With dead ends: 94 [2019-09-08 01:46:53,439 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 01:46:53,440 INFO L628 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-08 01:46:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 01:46:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-09-08 01:46:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 01:46:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-08 01:46:53,449 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-09-08 01:46:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:46:53,449 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-08 01:46:53,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:46:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-08 01:46:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 01:46:53,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:46:53,454 INFO L399 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-08 01:46:53,454 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:46:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:46:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-09-08 01:46:53,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:46:53,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:46:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:53,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:46:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:46:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:46:54,391 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-08 01:46:54,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:46:54,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:46:54,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:46:54,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:46:54,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:46:54,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-08 01:46:54,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:46:54,632 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-08 01:46:54,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:54,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2019-09-08 01:46:54,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:54,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-08 01:46:54,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,741 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-09-08 01:46:54,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 01:46:54,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:54,763 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-08 01:46:54,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-09-08 01:46:54,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:46:54,800 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-08 01:46:54,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:54,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-09-08 01:46:54,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:54,865 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-08 01:46:54,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,908 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-09-08 01:46:54,912 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-08 01:46:54,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:54,929 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-08 01:46:54,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-09-08 01:46:54,979 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-08 01:46:54,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:54,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:54,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:46:54,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-09-08 01:46:55,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:55,073 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-08 01:46:55,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:55,138 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-09-08 01:46:55,143 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-08 01:46:55,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:55,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:55,167 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-08 01:46:55,168 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-09-08 01:46:55,213 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-08 01:46:55,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:55,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:55,235 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-08 01:46:55,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-09-08 01:46:55,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:55,368 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-08 01:46:55,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:55,485 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 01:46:55,485 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-09-08 01:46:55,491 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-08 01:46:55,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:55,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:55,534 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-08 01:46:55,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-09-08 01:46:55,609 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-08 01:46:55,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:55,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:55,646 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-08 01:46:55,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-09-08 01:46:55,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:55,784 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-08 01:46:55,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:55,987 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 01:46:55,988 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-09-08 01:46:55,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 01:46:55,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:56,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:56,072 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-08 01:46:56,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-09-08 01:46:58,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 01:46:58,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:58,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:58,243 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-08 01:46:58,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-09-08 01:46:58,436 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-08 01:46:58,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:58,437 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-08 01:46:58,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:58,692 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 01:46:58,693 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-09-08 01:46:58,702 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-08 01:46:58,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:58,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:58,790 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-08 01:46:58,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-09-08 01:46:58,892 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-08 01:46:58,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:46:58,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:46:58,975 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-08 01:46:58,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-09-08 01:47:03,766 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-08 01:47:03,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:03,767 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-08 01:47:03,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:04,190 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-08 01:47:04,190 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-09-08 01:47:04,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 01:47:04,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:04,363 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-08 01:47:04,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:04,366 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-08 01:47:04,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-09-08 01:47:04,611 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-08 01:47:04,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:04,740 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-08 01:47:04,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:04,743 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-08 01:47:04,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-09-08 01:47:09,996 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-09-08 01:47:09,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:09,997 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-08 01:47:09,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:10,415 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-09-08 01:47:10,416 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-09-08 01:47:10,431 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-08 01:47:10,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:10,619 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-08 01:47:10,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:10,621 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-08 01:47:10,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-09-08 01:47:15,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-08 01:47:15,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:15,855 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-09-08 01:47:15,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:15,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-09-08 01:47:15,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200 [2019-09-08 01:47:34,616 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-09-08 01:47:34,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:34,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 57 treesize of output 279 [2019-09-08 01:47:34,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,217 WARN L188 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2019-09-08 01:47:35,218 INFO L567 ElimStorePlain]: treesize reduction 126, result has 66.7 percent of original size [2019-09-08 01:47:35,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 01:47:35,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,444 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-08 01:47:35,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-09-08 01:47:35,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:222, output treesize:241 [2019-09-08 01:47:51,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 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-08 01:47:51,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:51,594 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-08 01:47:51,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:51,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-09-08 01:47:51,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:260, output treesize:241 [2019-09-08 01:48:22,692 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-09-08 01:48:22,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:48:22,894 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1428) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:631) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-09-08 01:48:22,901 INFO L168 Benchmark]: Toolchain (without parser) took 103198.23 ms. Allocated memory was 130.5 MB in the beginning and 499.1 MB in the end (delta: 368.6 MB). Free memory was 85.9 MB in the beginning and 284.6 MB in the end (delta: -198.6 MB). Peak memory consumption was 169.9 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:22,901 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 130.5 MB. Free memory was 105.1 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:48:22,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.97 ms. Allocated memory was 130.5 MB in the beginning and 197.7 MB in the end (delta: 67.1 MB). Free memory was 85.7 MB in the beginning and 159.6 MB in the end (delta: -73.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:22,902 INFO L168 Benchmark]: Boogie Preprocessor took 90.11 ms. Allocated memory is still 197.7 MB. Free memory was 159.6 MB in the beginning and 156.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:22,903 INFO L168 Benchmark]: RCFGBuilder took 561.86 ms. Allocated memory is still 197.7 MB. Free memory was 156.9 MB in the beginning and 116.2 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:22,903 INFO L168 Benchmark]: TraceAbstraction took 101907.88 ms. Allocated memory was 197.7 MB in the beginning and 499.1 MB in the end (delta: 301.5 MB). Free memory was 116.2 MB in the beginning and 284.6 MB in the end (delta: -168.4 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:22,916 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 130.5 MB. Free memory was 105.1 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 633.97 ms. Allocated memory was 130.5 MB in the beginning and 197.7 MB in the end (delta: 67.1 MB). Free memory was 85.7 MB in the beginning and 159.6 MB in the end (delta: -73.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.11 ms. Allocated memory is still 197.7 MB. Free memory was 159.6 MB in the beginning and 156.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 561.86 ms. Allocated memory is still 197.7 MB. Free memory was 156.9 MB in the beginning and 116.2 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101907.88 ms. Allocated memory was 197.7 MB in the beginning and 499.1 MB in the end (delta: 301.5 MB). Free memory was 116.2 MB in the beginning and 284.6 MB in the end (delta: -168.4 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...