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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:47:21,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:47:21,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:47:21,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:47:21,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:47:21,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:47:21,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:47:21,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:47:21,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:47:21,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:47:21,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:47:21,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:47:21,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:47:21,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:47:21,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:47:21,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:47:21,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:47:21,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:47:21,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:47:21,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:47:21,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:47:21,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:47:21,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:47:21,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:47:21,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:47:21,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:47:21,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:47:21,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:47:21,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:47:21,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:47:21,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:47:21,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:47:21,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:47:21,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:47:21,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:47:21,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:47:21,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:47:21,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:47:21,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:47:21,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:47:21,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:47:21,642 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:47:21,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:47:21,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:47:21,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:47:21,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:47:21,677 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:47:21,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:47:21,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:47:21,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:47:21,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:47:21,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:47:21,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:47:21,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:47:21,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:47:21,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:47:21,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:47:21,679 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:47:21,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:47:21,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:47:21,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:47:21,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:47:21,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:47:21,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:47:21,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:47:21,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:47:21,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:47:21,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:47:21,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:47:21,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:47:21,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:47:21,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:47:21,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:47:21,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:47:21,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:47:21,729 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:47:21,730 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-2.i [2019-09-08 01:47:21,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58711fdfa/8c35e13faf0c4efe923e307b2a0b75a9/FLAG0700c6fdf [2019-09-08 01:47:22,287 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:47:22,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-09-08 01:47:22,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58711fdfa/8c35e13faf0c4efe923e307b2a0b75a9/FLAG0700c6fdf [2019-09-08 01:47:22,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58711fdfa/8c35e13faf0c4efe923e307b2a0b75a9 [2019-09-08 01:47:22,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:47:22,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:47:22,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:47:22,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:47:22,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:47:22,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:47:22" (1/1) ... [2019-09-08 01:47:22,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc4fb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:22, skipping insertion in model container [2019-09-08 01:47:22,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:47:22" (1/1) ... [2019-09-08 01:47:22,680 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:47:22,734 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:47:23,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:47:23,166 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:47:23,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:47:23,266 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:47:23,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23 WrapperNode [2019-09-08 01:47:23,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:47:23,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:47:23,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:47:23,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:47:23,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (1/1) ... [2019-09-08 01:47:23,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (1/1) ... [2019-09-08 01:47:23,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (1/1) ... [2019-09-08 01:47:23,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (1/1) ... [2019-09-08 01:47:23,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (1/1) ... [2019-09-08 01:47:23,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (1/1) ... [2019-09-08 01:47:23,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (1/1) ... [2019-09-08 01:47:23,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:47:23,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:47:23,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:47:23,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:47:23,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (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:47:23,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:47:23,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:47:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 01:47:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 01:47:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-08 01:47:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:47:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:47:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:47:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 01:47:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 01:47:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 01:47:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 01:47:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 01:47:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 01:47:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 01:47:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 01:47:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 01:47:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 01:47:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 01:47:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 01:47:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 01:47:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 01:47:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 01:47:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 01:47:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 01:47:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 01:47:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 01:47:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 01:47:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 01:47:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 01:47:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 01:47:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 01:47:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 01:47:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 01:47:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 01:47:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 01:47:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 01:47:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 01:47:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 01:47:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 01:47:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 01:47:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 01:47:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 01:47:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 01:47:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 01:47:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 01:47:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 01:47:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 01:47:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 01:47:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 01:47:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 01:47:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 01:47:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 01:47:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 01:47:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 01:47:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 01:47:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 01:47:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 01:47:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 01:47:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 01:47:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 01:47:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 01:47:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 01:47:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 01:47:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 01:47:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 01:47:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 01:47:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 01:47:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 01:47:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 01:47:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 01:47:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 01:47:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 01:47:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 01:47:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 01:47:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 01:47:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 01:47:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 01:47:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 01:47:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 01:47:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 01:47:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 01:47:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 01:47:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 01:47:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 01:47:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 01:47:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 01:47:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 01:47:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 01:47:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 01:47:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 01:47:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 01:47:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 01:47:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 01:47:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 01:47:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 01:47:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 01:47:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 01:47:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 01:47:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 01:47:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 01:47:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 01:47:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 01:47:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 01:47:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 01:47:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 01:47:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 01:47:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 01:47:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 01:47:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 01:47:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 01:47:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 01:47:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 01:47:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-08 01:47:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:47:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 01:47:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:47:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:47:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:47:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:47:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:47:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:47:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:47:23,723 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-08 01:47:23,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:47:23,915 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 01:47:23,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:47:23 BoogieIcfgContainer [2019-09-08 01:47:23,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:47:23,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:47:23,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:47:23,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:47:23,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:47:22" (1/3) ... [2019-09-08 01:47:23,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a414626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:47:23, skipping insertion in model container [2019-09-08 01:47:23,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:47:23" (2/3) ... [2019-09-08 01:47:23,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a414626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:47:23, skipping insertion in model container [2019-09-08 01:47:23,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:47:23" (3/3) ... [2019-09-08 01:47:23,925 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2019-09-08 01:47:23,934 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:47:23,943 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:47:23,959 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:47:23,988 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:47:23,989 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:47:23,989 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:47:23,989 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:47:23,990 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:47:23,990 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:47:23,991 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:47:23,991 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:47:23,991 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:47:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-08 01:47:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 01:47:24,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:24,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:47:24,018 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-09-08 01:47:24,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:24,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:24,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:24,169 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:47:24,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:47:24,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:47:24,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:47:24,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:47:24,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:47:24,190 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-08 01:47:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:24,209 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-09-08 01:47:24,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:47:24,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-08 01:47:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:24,219 INFO L225 Difference]: With dead ends: 45 [2019-09-08 01:47:24,219 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:47:24,223 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:47:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:47:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 01:47:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 01:47:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-08 01:47:24,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-09-08 01:47:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:24,267 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-08 01:47:24,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:47:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-08 01:47:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 01:47:24,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:24,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:47:24,269 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:24,271 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-09-08 01:47:24,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:24,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:24,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:24,362 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:47:24,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:47:24,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:47:24,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:47:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:47:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:47:24,365 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-09-08 01:47:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:24,383 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-09-08 01:47:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:47:24,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-08 01:47:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:24,385 INFO L225 Difference]: With dead ends: 32 [2019-09-08 01:47:24,385 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 01:47:24,386 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:47:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 01:47:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 01:47:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:47:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-08 01:47:24,394 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-09-08 01:47:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:24,394 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-08 01:47:24,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:47:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-08 01:47:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 01:47:24,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:24,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:47:24,396 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:24,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-09-08 01:47:24,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:24,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:24,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:24,450 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:47:24,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:47:24,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:47:24,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:47:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:47:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:47:24,452 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-09-08 01:47:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:24,495 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-08 01:47:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:47:24,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-08 01:47:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:24,497 INFO L225 Difference]: With dead ends: 43 [2019-09-08 01:47:24,497 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:47:24,497 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:47:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:47:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-09-08 01:47:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 01:47:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-08 01:47:24,503 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-08 01:47:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:24,503 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-08 01:47:24,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:47:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-08 01:47:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:47:24,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:24,505 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:47:24,505 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-09-08 01:47:24,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:24,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:24,627 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:47:24,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:47:24,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:47:24,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:47:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:47:24,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:47:24,634 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2019-09-08 01:47:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:24,719 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-08 01:47:24,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:47:24,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-08 01:47:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:24,721 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:47:24,721 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 01:47:24,722 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:47:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 01:47:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-08 01:47:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 01:47:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-08 01:47:24,727 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-09-08 01:47:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:24,727 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-08 01:47:24,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:47:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-08 01:47:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:47:24,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:24,729 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:47:24,729 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-09-08 01:47:24,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:24,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:24,792 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:47:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:47:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:47:24,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:47:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:47:24,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:47:24,794 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-09-08 01:47:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:24,859 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-08 01:47:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:47:24,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-08 01:47:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:24,862 INFO L225 Difference]: With dead ends: 37 [2019-09-08 01:47:24,862 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 01:47:24,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:47:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 01:47:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-08 01:47:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 01:47:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-08 01:47:24,872 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-09-08 01:47:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:24,872 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-08 01:47:24,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:47:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-08 01:47:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:47:24,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:24,876 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:47:24,876 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-09-08 01:47:24,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:24,984 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:47:24,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:24,984 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:47:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:25,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:47:25,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:25,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:25,127 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:47:25,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:25,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 01:47:25,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:47:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:47:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:47:25,148 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-08 01:47:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:25,216 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-08 01:47:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:47:25,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-08 01:47:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:25,217 INFO L225 Difference]: With dead ends: 54 [2019-09-08 01:47:25,218 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:47:25,218 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:47:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:47:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-09-08 01:47:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:47:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-08 01:47:25,224 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-09-08 01:47:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:25,224 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-08 01:47:25,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:47:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-08 01:47:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:47:25,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:25,225 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:47:25,226 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-09-08 01:47:25,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:25,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:25,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:25,297 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:47:25,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:25,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:47:25,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:47:25,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:47:25,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:25,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:47:25,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:25,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:25,384 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:47:25,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:25,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 01:47:25,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:47:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:47:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:47:25,396 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-08 01:47:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:25,487 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-09-08 01:47:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:47:25,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-08 01:47:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:25,488 INFO L225 Difference]: With dead ends: 59 [2019-09-08 01:47:25,489 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 01:47:25,489 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:47:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 01:47:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-09-08 01:47:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 01:47:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-08 01:47:25,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-09-08 01:47:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:25,496 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-08 01:47:25,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:47:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-08 01:47:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 01:47:25,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:25,497 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:47:25,497 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-09-08 01:47:25,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:25,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:25,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:47:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:25,571 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:47:25,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:25,571 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:47:25,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:47:25,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:47:25,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:25,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:47:25,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:25,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:25,678 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:47:25,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:25,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 01:47:25,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:47:25,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:47:25,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:47:25,689 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 8 states. [2019-09-08 01:47:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:25,808 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-08 01:47:25,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:47:25,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-08 01:47:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:25,813 INFO L225 Difference]: With dead ends: 64 [2019-09-08 01:47:25,814 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 01:47:25,816 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:47:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 01:47:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-08 01:47:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:47:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-08 01:47:25,826 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-09-08 01:47:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:25,828 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-08 01:47:25,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:47:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-08 01:47:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:47:25,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:25,829 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:47:25,830 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:25,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-09-08 01:47:25,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:25,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:25,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:47:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:25,962 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:47:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:25,962 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) [2019-09-08 01:47:25,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:47:26,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:47:26,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:26,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:47:26,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:26,103 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:47:26,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:26,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 01:47:26,185 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:26,186 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:47:26,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,224 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-08 01:47:26,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-08 01:47:26,297 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:47:26,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:26,315 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:47:26,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-09-08 01:47:26,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:26,405 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:47:26,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,470 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-09-08 01:47:26,501 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-08 01:47:26,501 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:47:26,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,547 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-09-08 01:47:26,547 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:47:26,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-09-08 01:47:26,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:26,618 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:47:26,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:26,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,680 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-09-08 01:47:26,683 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:47:26,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-09-08 01:47:26,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:26,805 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:47:26,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:26,924 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 01:47:26,924 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-09-08 01:47:26,991 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-09-08 01:47:26,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:47:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,013 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:47:27,093 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-09-08 01:47:27,094 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:47:27,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-09-08 01:47:27,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:27,228 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:47:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-09-08 01:47:27,333 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-09-08 01:47:27,335 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:47:27,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-09-08 01:47:27,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:27,415 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:47:27,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:27,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:27,586 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 01:47:27,586 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-09-08 01:47:27,587 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:47:27,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,613 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:47:27,700 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-09-08 01:47:27,702 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:47:27,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-09-08 01:47:27,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:27,852 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:47:27,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:27,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:27,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-09-08 01:47:28,124 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-08 01:47:28,125 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-09-08 01:47:28,127 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:47:28,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-09-08 01:47:28,190 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-09-08 01:47:28,196 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:47:28,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:28,645 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-09-08 01:47:28,646 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-09-08 01:47:28,646 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:47:28,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:28,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:47:28,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-09-08 01:47:29,540 WARN L188 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-09-08 01:47:29,540 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-09-08 01:47:29,542 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:47:29,542 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-09-08 01:47:29,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:29,714 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:47:29,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:29,759 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:47:29,830 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-09-08 01:47:29,831 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:47:29,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-09-08 01:47:29,877 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:47:29,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:29,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-09-08 01:47:29,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:47:29,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:47:29,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:47:29,884 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 21 states. [2019-09-08 01:47:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:31,100 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-09-08 01:47:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:47:31,100 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-08 01:47:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:31,102 INFO L225 Difference]: With dead ends: 75 [2019-09-08 01:47:31,102 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 01:47:31,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:47:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 01:47:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-09-08 01:47:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 01:47:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-08 01:47:31,110 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-09-08 01:47:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:31,110 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-08 01:47:31,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:47:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-08 01:47:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 01:47:31,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:31,112 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:47:31,112 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-09-08 01:47:31,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:31,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:31,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:31,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:47:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:31,191 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:47:31,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:31,191 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:47:31,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:47:31,463 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:47:31,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:31,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:47:31,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:31,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:31,489 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:47:31,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:31,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 01:47:31,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:47:31,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:47:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:47:31,504 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2019-09-08 01:47:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:31,636 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-09-08 01:47:31,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:47:31,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-08 01:47:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:31,640 INFO L225 Difference]: With dead ends: 74 [2019-09-08 01:47:31,640 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 01:47:31,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:47:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 01:47:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-09-08 01:47:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 01:47:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-08 01:47:31,646 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-09-08 01:47:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:31,647 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-08 01:47:31,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:47:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-08 01:47:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 01:47:31,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:31,648 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:47:31,648 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:31,649 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-09-08 01:47:31,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:31,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:31,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:31,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:47:31,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:31,740 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:47:31,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:31,741 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:47:31,769 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:47:32,035 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:47:32,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:32,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:47:32,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:32,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:32,070 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:47:32,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:32,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 01:47:32,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:47:32,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:47:32,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:47:32,078 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 11 states. [2019-09-08 01:47:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:32,221 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-09-08 01:47:32,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:47:32,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-08 01:47:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:32,223 INFO L225 Difference]: With dead ends: 79 [2019-09-08 01:47:32,223 INFO L226 Difference]: Without dead ends: 61 [2019-09-08 01:47:32,223 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:47:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-08 01:47:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-09-08 01:47:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 01:47:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-08 01:47:32,229 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-09-08 01:47:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:32,230 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-08 01:47:32,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:47:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-08 01:47:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 01:47:32,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:32,231 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:47:32,231 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-09-08 01:47:32,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:32,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:32,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:32,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:47:32,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:32,349 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:47:32,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:32,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:47:32,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:47:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:32,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:47:32,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:32,474 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:47:32,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 01:47:32,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:47:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:47:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:47:32,480 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 12 states. [2019-09-08 01:47:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:32,635 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-08 01:47:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:47:32,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-08 01:47:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:32,636 INFO L225 Difference]: With dead ends: 84 [2019-09-08 01:47:32,637 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 01:47:32,637 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:47:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 01:47:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-08 01:47:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 01:47:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-08 01:47:32,643 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-09-08 01:47:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:32,644 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-08 01:47:32,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:47:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-08 01:47:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 01:47:32,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:32,645 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:47:32,645 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:32,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:32,646 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-09-08 01:47:32,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:32,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:32,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:47:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:32,758 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:47:32,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:32,759 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:47:32,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:47:32,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:47:32,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:32,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:47:32,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:32,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:32,842 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:47:32,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:32,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 01:47:32,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:47:32,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:47:32,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:47:32,854 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 13 states. [2019-09-08 01:47:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:33,032 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-09-08 01:47:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:47:33,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-08 01:47:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:33,035 INFO L225 Difference]: With dead ends: 89 [2019-09-08 01:47:33,035 INFO L226 Difference]: Without dead ends: 71 [2019-09-08 01:47:33,036 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:47:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-08 01:47:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-09-08 01:47:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 01:47:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-08 01:47:33,043 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-09-08 01:47:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:33,043 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-08 01:47:33,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:47:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-08 01:47:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 01:47:33,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:33,044 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:47:33,044 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-09-08 01:47:33,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:33,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:33,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:47:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:33,173 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:47:33,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:33,173 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:47:33,187 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:47:34,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:47:34,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:34,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:47:34,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:34,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:47:34,379 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:47:34,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:47:34,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 01:47:34,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:47:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:47:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:47:34,388 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2019-09-08 01:47:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:47:34,566 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-09-08 01:47:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:47:34,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-08 01:47:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:47:34,567 INFO L225 Difference]: With dead ends: 94 [2019-09-08 01:47:34,568 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 01:47:34,569 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:47:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 01:47:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-09-08 01:47:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 01:47:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-08 01:47:34,575 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-09-08 01:47:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:47:34,575 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-08 01:47:34,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:47:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-08 01:47:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 01:47:34,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:47:34,577 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:47:34,577 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:47:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:47:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-09-08 01:47:34,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:47:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:47:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:34,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:47:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:47:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:47:35,285 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:47:35,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:47:35,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:47:35,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:47:35,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:47:35,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:47:35,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-08 01:47:35,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:47:35,451 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:47:35,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 01:47:35,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,497 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:47:35,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,536 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-09-08 01:47:35,541 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:47:35,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,553 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:47:35,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-09-08 01:47:35,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:47:35,584 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:47:35,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-09-08 01:47:35,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,663 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:47:35,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,717 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-09-08 01:47:35,730 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:47:35,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,753 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:47:35,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-09-08 01:47:35,797 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:47:35,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,812 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:47:35,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-09-08 01:47:35,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:35,902 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:47:35,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:35,980 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-09-08 01:47:35,984 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:47:35,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:36,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:36,010 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:47:36,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-09-08 01:47:36,057 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:47:36,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:36,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:36,082 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:47:36,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-09-08 01:47:36,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:36,200 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:47:36,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:36,325 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 01:47:36,326 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-09-08 01:47:36,351 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:47:36,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:36,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:36,388 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:47:36,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-09-08 01:47:36,455 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:47:36,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:36,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:36,492 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:47:36,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-09-08 01:47:36,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:36,639 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:47:36,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:36,816 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 01:47:36,816 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-09-08 01:47:36,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:47:36,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:36,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:36,874 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:47:36,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-09-08 01:47:37,008 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:47:37,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:37,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:37,065 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:47:37,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-09-08 01:47:37,250 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-08 01:47:37,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:37,251 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:47:37,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:37,483 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 01:47:37,483 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-09-08 01:47:37,490 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:47:37,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:37,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:37,576 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:47:37,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-09-08 01:47:39,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 27 treesize of output 11 [2019-09-08 01:47:39,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:39,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:39,784 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:47:39,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-09-08 01:47:42,192 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-08 01:47:42,193 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:42,193 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:42,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:42,507 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-08 01:47:42,508 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-09-08 01:47:42,518 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:42,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:42,631 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-08 01:47:42,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:42,634 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:42,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-09-08 01:47:42,930 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:42,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:43,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:43,031 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:43,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-09-08 01:47:50,860 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-09-08 01:47:50,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:50,861 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:50,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:51,329 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-09-08 01:47:51,329 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-09-08 01:47:51,339 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:51,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:51,517 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-08 01:47:51,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:51,519 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:51,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-09-08 01:47:55,063 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:55,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:47:55,217 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-09-08 01:47:55,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:47:55,219 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:55,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200 [2019-09-08 01:48:15,897 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-09-08 01:48:15,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:48:15,898 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:48:15,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:48:16,589 WARN L188 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2019-09-08 01:48:16,590 INFO L567 ElimStorePlain]: treesize reduction 126, result has 66.7 percent of original size [2019-09-08 01:48:16,602 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:48:16,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:48:16,835 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-08 01:48:16,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:48:16,837 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:48:16,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:222, output treesize:241 [2019-09-08 01:48:30,327 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:48:30,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:48:30,529 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-08 01:48:30,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:48:30,531 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:48:30,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:260, output treesize:241 [2019-09-08 01:48:57,721 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:57,922 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:57,923 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:57,933 INFO L168 Benchmark]: Toolchain (without parser) took 95265.64 ms. Allocated memory was 134.7 MB in the beginning and 418.4 MB in the end (delta: 283.6 MB). Free memory was 89.4 MB in the beginning and 269.5 MB in the end (delta: -180.2 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:57,933 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-09-08 01:48:57,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.19 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 89.2 MB in the beginning and 166.5 MB in the end (delta: -77.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:57,935 INFO L168 Benchmark]: Boogie Preprocessor took 70.34 ms. Allocated memory is still 201.9 MB. Free memory was 166.5 MB in the beginning and 164.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:57,936 INFO L168 Benchmark]: RCFGBuilder took 578.92 ms. Allocated memory is still 201.9 MB. Free memory was 164.1 MB in the beginning and 122.7 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:57,937 INFO L168 Benchmark]: TraceAbstraction took 94011.01 ms. Allocated memory was 201.9 MB in the beginning and 418.4 MB in the end (delta: 216.5 MB). Free memory was 122.7 MB in the beginning and 269.5 MB in the end (delta: -146.9 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2019-09-08 01:48:57,939 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 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 601.19 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 89.2 MB in the beginning and 166.5 MB in the end (delta: -77.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.34 ms. Allocated memory is still 201.9 MB. Free memory was 166.5 MB in the beginning and 164.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 578.92 ms. Allocated memory is still 201.9 MB. Free memory was 164.1 MB in the beginning and 122.7 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94011.01 ms. Allocated memory was 201.9 MB in the beginning and 418.4 MB in the end (delta: 216.5 MB). Free memory was 122.7 MB in the beginning and 269.5 MB in the end (delta: -146.9 MB). Peak memory consumption was 69.6 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...