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-efa34d5 [2019-09-16 16:27:19,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:27:19,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:27:19,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:27:19,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:27:19,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:27:19,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:27:19,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:27:19,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:27:19,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:27:19,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:27:19,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:27:19,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:27:19,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:27:19,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:27:19,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:27:19,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:27:19,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:27:19,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:27:19,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:27:19,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:27:19,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:27:19,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:27:19,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:27:19,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:27:19,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:27:19,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:27:19,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:27:19,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:27:19,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:27:19,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:27:19,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:27:19,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:27:19,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:27:19,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:27:19,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:27:19,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:27:19,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:27:19,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:27:19,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:27:19,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:27:19,952 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-16 16:27:19,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:27:19,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:27:19,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:27:19,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:27:19,968 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:27:19,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:27:19,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:27:19,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:27:19,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:27:19,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:27:19,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:27:19,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:27:19,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:27:19,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:27:19,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:27:19,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:27:19,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:27:19,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:27:19,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:27:19,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:27:19,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:27:19,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:27:19,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:27:19,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:27:19,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:27:19,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:27:19,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:27:19,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:27:19,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:27:20,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:27:20,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:27:20,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:27:20,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:27:20,020 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:27:20,020 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-16 16:27:20,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827477d5e/a1c3969e9d5748afab3db2bdb1377c14/FLAG7f9210a20 [2019-09-16 16:27:20,640 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:27:20,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-09-16 16:27:20,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827477d5e/a1c3969e9d5748afab3db2bdb1377c14/FLAG7f9210a20 [2019-09-16 16:27:20,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827477d5e/a1c3969e9d5748afab3db2bdb1377c14 [2019-09-16 16:27:20,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:27:20,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:27:20,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:27:20,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:27:20,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:27:20,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:27:20" (1/1) ... [2019-09-16 16:27:20,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e072ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:20, skipping insertion in model container [2019-09-16 16:27:20,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:27:20" (1/1) ... [2019-09-16 16:27:20,953 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:27:20,997 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:27:21,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:27:21,429 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:27:21,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:27:21,549 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:27:21,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21 WrapperNode [2019-09-16 16:27:21,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:27:21,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:27:21,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:27:21,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:27:21,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (1/1) ... [2019-09-16 16:27:21,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (1/1) ... [2019-09-16 16:27:21,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (1/1) ... [2019-09-16 16:27:21,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (1/1) ... [2019-09-16 16:27:21,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (1/1) ... [2019-09-16 16:27:21,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (1/1) ... [2019-09-16 16:27:21,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (1/1) ... [2019-09-16 16:27:21,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:27:21,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:27:21,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:27:21,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:27:21,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (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-16 16:27:21,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:27:21,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:27:21,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-16 16:27:21,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-16 16:27:21,689 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-16 16:27:21,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:27:21,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:27:21,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:27:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-16 16:27:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-16 16:27:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-16 16:27:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-16 16:27:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-16 16:27:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-16 16:27:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-16 16:27:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-16 16:27:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-16 16:27:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-16 16:27:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-16 16:27:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-16 16:27:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-16 16:27:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-16 16:27:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-16 16:27:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-16 16:27:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-16 16:27:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-16 16:27:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-16 16:27:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-16 16:27:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-16 16:27:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-16 16:27:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-16 16:27:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-16 16:27:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-16 16:27:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-16 16:27:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-16 16:27:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-16 16:27:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-16 16:27:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-16 16:27:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-16 16:27:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-16 16:27:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-16 16:27:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-16 16:27:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-16 16:27:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-16 16:27:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-16 16:27:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-16 16:27:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-16 16:27:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-16 16:27:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-16 16:27:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-16 16:27:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-16 16:27:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-16 16:27:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-16 16:27:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-16 16:27:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-16 16:27:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-16 16:27:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-16 16:27:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-16 16:27:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-16 16:27:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-16 16:27:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:27:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:27:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-16 16:27:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:27:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-16 16:27:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-16 16:27:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-16 16:27:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-16 16:27:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-16 16:27:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-16 16:27:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-16 16:27:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-16 16:27:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-16 16:27:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-16 16:27:21,701 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-16 16:27:21,701 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-16 16:27:21,701 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-16 16:27:21,701 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-16 16:27:21,701 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-16 16:27:21,701 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-16 16:27:21,702 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-16 16:27:21,702 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-16 16:27:21,702 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-16 16:27:21,702 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-16 16:27:21,702 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-16 16:27:21,702 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-16 16:27:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-16 16:27:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-16 16:27:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-16 16:27:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-16 16:27:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-16 16:27:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-16 16:27:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-16 16:27:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-16 16:27:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-16 16:27:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-16 16:27:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-16 16:27:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-16 16:27:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-16 16:27:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-16 16:27:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-16 16:27:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-16 16:27:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-16 16:27:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-16 16:27:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-16 16:27:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-16 16:27:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-16 16:27:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-16 16:27:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-16 16:27:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-16 16:27:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-16 16:27:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-16 16:27:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-16 16:27:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-16 16:27:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:27:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:27:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:27:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:27:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:27:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:27:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:27:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:27:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:27:22,047 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-16 16:27:22,199 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:27:22,200 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-16 16:27:22,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:27:22 BoogieIcfgContainer [2019-09-16 16:27:22,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:27:22,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:27:22,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:27:22,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:27:22,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:27:20" (1/3) ... [2019-09-16 16:27:22,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d18b7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:27:22, skipping insertion in model container [2019-09-16 16:27:22,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:27:21" (2/3) ... [2019-09-16 16:27:22,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d18b7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:27:22, skipping insertion in model container [2019-09-16 16:27:22,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:27:22" (3/3) ... [2019-09-16 16:27:22,210 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2019-09-16 16:27:22,221 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:27:22,230 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:27:22,247 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:27:22,279 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:27:22,279 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:27:22,280 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:27:22,281 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:27:22,281 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:27:22,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:27:22,281 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:27:22,281 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:27:22,282 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:27:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-16 16:27:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-16 16:27:22,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:22,308 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:22,311 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:22,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:22,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-09-16 16:27:22,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:22,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:22,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:22,457 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-16 16:27:22,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:27:22,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:27:22,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:27:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:27:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:27:22,483 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-16 16:27:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:22,511 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-09-16 16:27:22,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:27:22,513 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-16 16:27:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:22,523 INFO L225 Difference]: With dead ends: 45 [2019-09-16 16:27:22,524 INFO L226 Difference]: Without dead ends: 22 [2019-09-16 16:27:22,528 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:27:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-16 16:27:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-16 16:27:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-16 16:27:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-16 16:27:22,576 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-09-16 16:27:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:22,576 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-16 16:27:22,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:27:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-16 16:27:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:27:22,578 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:22,578 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:22,579 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-09-16 16:27:22,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:22,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:22,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:22,660 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-16 16:27:22,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:27:22,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:27:22,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:27:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:27:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:27:22,665 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-09-16 16:27:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:22,701 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-09-16 16:27:22,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:27:22,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-16 16:27:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:22,703 INFO L225 Difference]: With dead ends: 32 [2019-09-16 16:27:22,704 INFO L226 Difference]: Without dead ends: 23 [2019-09-16 16:27:22,706 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:27:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-16 16:27:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-16 16:27:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-16 16:27:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-16 16:27:22,718 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-09-16 16:27:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:22,719 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-16 16:27:22,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:27:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-16 16:27:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:27:22,720 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:22,720 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:22,721 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-09-16 16:27:22,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:22,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:22,824 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-16 16:27:22,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:27:22,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:27:22,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:27:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:27:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:27:22,829 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-09-16 16:27:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:22,877 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-16 16:27:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:27:22,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-16 16:27:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:22,878 INFO L225 Difference]: With dead ends: 43 [2019-09-16 16:27:22,879 INFO L226 Difference]: Without dead ends: 28 [2019-09-16 16:27:22,879 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:27:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-16 16:27:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-09-16 16:27:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-16 16:27:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-16 16:27:22,885 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-16 16:27:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:22,885 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-16 16:27:22,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:27:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-16 16:27:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:27:22,887 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:22,887 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:22,887 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-09-16 16:27:22,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:22,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:23,024 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-16 16:27:23,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:27:23,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:27:23,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:27:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:27:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:27:23,026 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2019-09-16 16:27:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:23,096 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-16 16:27:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:27:23,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-16 16:27:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:23,098 INFO L225 Difference]: With dead ends: 36 [2019-09-16 16:27:23,098 INFO L226 Difference]: Without dead ends: 33 [2019-09-16 16:27:23,098 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:27:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-16 16:27:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-16 16:27:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-16 16:27:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-16 16:27:23,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-09-16 16:27:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:23,109 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-16 16:27:23,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:27:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-16 16:27:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:27:23,111 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:23,111 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:23,112 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:23,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-09-16 16:27:23,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:23,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:23,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:23,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:23,188 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-16 16:27:23,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:27:23,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:27:23,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:27:23,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:27:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:27:23,190 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-09-16 16:27:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:23,259 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-16 16:27:23,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:27:23,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-16 16:27:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:23,261 INFO L225 Difference]: With dead ends: 37 [2019-09-16 16:27:23,261 INFO L226 Difference]: Without dead ends: 29 [2019-09-16 16:27:23,262 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:27:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-16 16:27:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-16 16:27:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-16 16:27:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-16 16:27:23,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-09-16 16:27:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:23,267 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-16 16:27:23,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:27:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-16 16:27:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:27:23,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:23,269 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:23,269 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-09-16 16:27:23,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:23,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:23,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:23,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:23,321 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-16 16:27:23,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:23,322 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:23,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:23,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:27:23,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:23,508 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-16 16:27:23,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:23,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-16 16:27:23,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:27:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:27:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:27:23,525 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-16 16:27:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:23,609 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-16 16:27:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:27:23,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-16 16:27:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:23,611 INFO L225 Difference]: With dead ends: 54 [2019-09-16 16:27:23,611 INFO L226 Difference]: Without dead ends: 36 [2019-09-16 16:27:23,612 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:27:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-16 16:27:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-09-16 16:27:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-16 16:27:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-16 16:27:23,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-09-16 16:27:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:23,621 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-16 16:27:23,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:27:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-16 16:27:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:27:23,623 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:23,623 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:23,624 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-09-16 16:27:23,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:23,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:23,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:23,724 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-16 16:27:23,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:23,725 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:23,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:27:23,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:27:23,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:23,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:27:23,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:27:23,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:23,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-16 16:27:23,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:27:23,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:27:23,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:27:23,884 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-16 16:27:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:23,989 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-09-16 16:27:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:27:23,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-16 16:27:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:23,991 INFO L225 Difference]: With dead ends: 59 [2019-09-16 16:27:23,991 INFO L226 Difference]: Without dead ends: 41 [2019-09-16 16:27:23,991 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:27:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-16 16:27:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-09-16 16:27:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-16 16:27:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-16 16:27:23,998 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-09-16 16:27:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:23,998 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-16 16:27:23,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:27:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-16 16:27:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:27:24,000 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:24,000 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:24,000 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-09-16 16:27:24,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:24,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:24,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:27:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:24,082 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-16 16:27:24,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:24,083 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:24,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:27:24,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 16:27:24,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:24,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-16 16:27:24,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:24,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:24,295 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-16 16:27:24,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:24,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-16 16:27:24,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:27:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:27:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:27:24,309 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 8 states. [2019-09-16 16:27:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:24,430 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-16 16:27:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:27:24,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-16 16:27:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:24,432 INFO L225 Difference]: With dead ends: 64 [2019-09-16 16:27:24,432 INFO L226 Difference]: Without dead ends: 46 [2019-09-16 16:27:24,433 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:27:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-16 16:27:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-16 16:27:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-16 16:27:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-16 16:27:24,442 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-09-16 16:27:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:24,443 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-16 16:27:24,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:27:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-16 16:27:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:27:24,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:24,446 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:24,447 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-09-16 16:27:24,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:24,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:24,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:27:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:24,562 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-16 16:27:24,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:24,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:24,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:27:24,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:27:24,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:24,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-16 16:27:24,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:24,744 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-16 16:27:24,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:24,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:24,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:27:24,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:27:24,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:24,813 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-16 16:27:24,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:24,846 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-16 16:27:24,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:27:24,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-16 16:27:24,907 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-16 16:27:24,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:24,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:24,923 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-16 16:27:24,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-09-16 16:27:25,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:25,022 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-16 16:27:25,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:25,099 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-09-16 16:27:25,140 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-16 16:27:25,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 40 [2019-09-16 16:27:25,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:25,187 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-09-16 16:27:25,187 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-16 16:27:25,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-09-16 16:27:25,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:25,293 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-16 16:27:25,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:25,349 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-09-16 16:27:25,350 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-16 16:27:25,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-09-16 16:27:25,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:25,522 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-16 16:27:25,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:25,626 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-16 16:27:25,627 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-09-16 16:27:25,698 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-09-16 16:27:25,699 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-16 16:27:25,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,708 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-16 16:27:25,777 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-09-16 16:27:25,779 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-16 16:27:25,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-09-16 16:27:25,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:25,894 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-16 16:27:25,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:25,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:25,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:25,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-09-16 16:27:26,034 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-16 16:27:26,035 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-09-16 16:27:26,037 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-16 16:27:26,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-09-16 16:27:26,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:26,142 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-16 16:27:26,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:26,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:26,330 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-16 16:27:26,331 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-09-16 16:27:26,331 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-16 16:27:26,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,396 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-16 16:27:26,474 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-09-16 16:27:26,477 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-16 16:27:26,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-09-16 16:27:26,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:26,639 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-16 16:27:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:26,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:26,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-09-16 16:27:26,902 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-16 16:27:26,902 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-09-16 16:27:26,905 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-16 16:27:26,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-09-16 16:27:26,991 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-09-16 16:27:26,999 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-16 16:27:27,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:27,516 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-09-16 16:27:27,516 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-09-16 16:27:27,517 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-16 16:27:27,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:27,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:27,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-09-16 16:27:28,453 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-09-16 16:27:28,453 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-09-16 16:27:28,455 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-16 16:27:28,456 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-09-16 16:27:28,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:28,605 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-16 16:27:28,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:28,651 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-16 16:27:28,739 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-09-16 16:27:28,740 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-16 16:27:28,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-09-16 16:27:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:27:28,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:28,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-09-16 16:27:28,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-16 16:27:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-16 16:27:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-16 16:27:28,797 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 21 states. [2019-09-16 16:27:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:29,996 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-09-16 16:27:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-16 16:27:29,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-16 16:27:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:29,997 INFO L225 Difference]: With dead ends: 75 [2019-09-16 16:27:29,997 INFO L226 Difference]: Without dead ends: 57 [2019-09-16 16:27:29,999 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-09-16 16:27:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-16 16:27:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-09-16 16:27:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-16 16:27:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-16 16:27:30,005 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-09-16 16:27:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:30,005 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-16 16:27:30,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-16 16:27:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-16 16:27:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 16:27:30,006 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:30,006 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:30,007 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-09-16 16:27:30,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:30,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:30,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:27:30,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:30,131 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-16 16:27:30,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:30,131 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:30,195 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-16 16:27:30,420 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-16 16:27:30,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:30,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 16:27:30,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:30,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:30,441 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-16 16:27:30,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-16 16:27:30,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:27:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:27:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:27:30,450 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2019-09-16 16:27:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:30,566 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-09-16 16:27:30,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-16 16:27:30,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-16 16:27:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:30,569 INFO L225 Difference]: With dead ends: 74 [2019-09-16 16:27:30,569 INFO L226 Difference]: Without dead ends: 56 [2019-09-16 16:27:30,573 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:27:30,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-16 16:27:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-09-16 16:27:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-16 16:27:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-16 16:27:30,585 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-09-16 16:27:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:30,585 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-16 16:27:30,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:27:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-16 16:27:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 16:27:30,588 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:30,588 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:30,589 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-09-16 16:27:30,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:30,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:30,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:30,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:27:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:30,744 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-16 16:27:30,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:30,744 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:30,857 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-16 16:27:31,294 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-16 16:27:31,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:31,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-16 16:27:31,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:31,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:31,333 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-16 16:27:31,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:31,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-16 16:27:31,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:27:31,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:27:31,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:27:31,341 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 11 states. [2019-09-16 16:27:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:31,510 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-09-16 16:27:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-16 16:27:31,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-16 16:27:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:31,512 INFO L225 Difference]: With dead ends: 79 [2019-09-16 16:27:31,512 INFO L226 Difference]: Without dead ends: 61 [2019-09-16 16:27:31,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2019-09-16 16:27:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-16 16:27:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-09-16 16:27:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-16 16:27:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-16 16:27:31,529 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-09-16 16:27:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:31,530 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-16 16:27:31,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:27:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-16 16:27:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 16:27:31,531 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:31,532 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:31,532 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:31,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:31,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-09-16 16:27:31,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:31,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:31,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:27:31,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:31,696 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-16 16:27:31,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:31,696 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:31,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:31,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-16 16:27:31,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:31,838 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-16 16:27:31,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-16 16:27:31,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-16 16:27:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-16 16:27:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:27:31,850 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 12 states. [2019-09-16 16:27:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:32,025 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-16 16:27:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-16 16:27:32,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-16 16:27:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:32,027 INFO L225 Difference]: With dead ends: 84 [2019-09-16 16:27:32,027 INFO L226 Difference]: Without dead ends: 66 [2019-09-16 16:27:32,027 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2019-09-16 16:27:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-16 16:27:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-16 16:27:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-16 16:27:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-16 16:27:32,033 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-09-16 16:27:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:32,034 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-16 16:27:32,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-16 16:27:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-16 16:27:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 16:27:32,035 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:32,035 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:32,035 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-09-16 16:27:32,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:32,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:32,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:32,139 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-16 16:27:32,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:32,140 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:32,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:27:32,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:27:32,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:32,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-16 16:27:32,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:32,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:32,291 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-16 16:27:32,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:32,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-16 16:27:32,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 16:27:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 16:27:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-16 16:27:32,297 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 13 states. [2019-09-16 16:27:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:32,476 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-09-16 16:27:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-16 16:27:32,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-16 16:27:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:32,478 INFO L225 Difference]: With dead ends: 89 [2019-09-16 16:27:32,478 INFO L226 Difference]: Without dead ends: 71 [2019-09-16 16:27:32,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2019-09-16 16:27:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-16 16:27:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-09-16 16:27:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-16 16:27:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-16 16:27:32,487 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-09-16 16:27:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:32,487 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-16 16:27:32,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 16:27:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-16 16:27:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 16:27:32,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:32,489 INFO L407 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:32,489 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-09-16 16:27:32,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:32,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:32,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:32,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:27:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:32,667 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-16 16:27:32,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:32,668 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:32,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:27:34,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-16 16:27:34,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:34,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-16 16:27:34,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:34,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:34,272 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-16 16:27:34,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:34,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-16 16:27:34,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 16:27:34,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 16:27:34,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:27:34,284 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2019-09-16 16:27:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:34,477 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-09-16 16:27:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-16 16:27:34,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-16 16:27:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:34,478 INFO L225 Difference]: With dead ends: 94 [2019-09-16 16:27:34,479 INFO L226 Difference]: Without dead ends: 76 [2019-09-16 16:27:34,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2019-09-16 16:27:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-16 16:27:34,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-09-16 16:27:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-16 16:27:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-16 16:27:34,486 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-09-16 16:27:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:34,486 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-16 16:27:34,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 16:27:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-16 16:27:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-16 16:27:34,487 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:34,487 INFO L407 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:34,487 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-09-16 16:27:34,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:34,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:27:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:35,048 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-16 16:27:35,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:35,048 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:35,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:27:35,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:27:35,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:27:35,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-16 16:27:35,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:35,280 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-16 16:27:35,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:27:35,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,346 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-16 16:27:35,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,385 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-09-16 16:27:35,390 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-16 16:27:35,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,405 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-16 16:27:35,405 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-09-16 16:27:35,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:27:35,452 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-16 16:27:35,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-09-16 16:27:35,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,535 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-16 16:27:35,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,591 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-09-16 16:27:35,595 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-16 16:27:35,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,616 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-16 16:27:35,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-09-16 16:27:35,667 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-16 16:27:35,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,684 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-16 16:27:35,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-09-16 16:27:35,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,815 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-16 16:27:35,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,893 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-09-16 16:27:35,898 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-16 16:27:35,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:35,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:35,929 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-16 16:27:35,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-09-16 16:27:35,983 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-16 16:27:35,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:36,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:36,006 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-16 16:27:36,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-09-16 16:27:36,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:36,137 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-16 16:27:36,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:36,253 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-16 16:27:36,254 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-09-16 16:27:36,265 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-16 16:27:36,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:36,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:36,313 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-16 16:27:36,314 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-09-16 16:27:36,376 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-16 16:27:36,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:36,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:36,414 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-16 16:27:36,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-09-16 16:27:36,601 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-16 16:27:36,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:36,602 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-16 16:27:36,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:36,840 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-16 16:27:36,841 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-09-16 16:27:36,849 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-16 16:27:36,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:36,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:36,933 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-16 16:27:36,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-09-16 16:27:37,030 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-16 16:27:37,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:37,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:37,086 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-16 16:27:37,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-09-16 16:27:37,299 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-16 16:27:37,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:37,301 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-16 16:27:37,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:37,547 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-16 16:27:37,547 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-09-16 16:27:37,560 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-16 16:27:37,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:37,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:37,649 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-16 16:27:37,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-09-16 16:27:37,905 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-16 16:27:37,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:37,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:37,986 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-16 16:27:37,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-09-16 16:27:41,904 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-16 16:27:41,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:41,905 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-16 16:27:41,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:42,325 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-16 16:27:42,326 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-09-16 16:27:42,342 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-16 16:27:42,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:42,524 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-16 16:27:42,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:42,527 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-16 16:27:42,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-09-16 16:27:42,957 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-16 16:27:42,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:43,104 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-16 16:27:43,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:43,106 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-16 16:27:43,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-09-16 16:27:51,070 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-09-16 16:27:51,071 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:51,071 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-16 16:27:51,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:51,533 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-09-16 16:27:51,534 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-09-16 16:27:51,546 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-16 16:27:51,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:51,736 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-16 16:27:51,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:51,738 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-16 16:27:51,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-09-16 16:27:54,743 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-16 16:27:54,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:54,899 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-09-16 16:27:54,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:54,901 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-16 16:27:54,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200 [2019-09-16 16:28:18,036 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-09-16 16:28:18,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:28:18,038 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-16 16:28:18,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:28:18,583 WARN L191 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2019-09-16 16:28:18,583 INFO L567 ElimStorePlain]: treesize reduction 126, result has 66.7 percent of original size [2019-09-16 16:28:18,594 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-16 16:28:18,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:28:18,809 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-16 16:28:18,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:28:18,812 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-16 16:28:18,812 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:222, output treesize:241 [2019-09-16 16:28:35,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-16 16:28:35,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:28:35,442 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-16 16:28:35,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:28:35,445 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-16 16:28:35,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:260, output treesize:241 [2019-09-16 16:29:05,658 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-09-16 16:29:05,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:29:05,861 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.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) 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:233) 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:461) 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) ... 40 more [2019-09-16 16:29:05,868 INFO L168 Benchmark]: Toolchain (without parser) took 104932.41 ms. Allocated memory was 140.5 MB in the beginning and 470.8 MB in the end (delta: 330.3 MB). Free memory was 85.3 MB in the beginning and 364.6 MB in the end (delta: -279.2 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:05,868 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:29:05,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.71 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 85.1 MB in the beginning and 166.9 MB in the end (delta: -81.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:05,869 INFO L168 Benchmark]: Boogie Preprocessor took 79.74 ms. Allocated memory is still 201.3 MB. Free memory was 166.9 MB in the beginning and 164.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:05,869 INFO L168 Benchmark]: RCFGBuilder took 570.83 ms. Allocated memory is still 201.3 MB. Free memory was 164.4 MB in the beginning and 122.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:05,870 INFO L168 Benchmark]: TraceAbstraction took 103663.70 ms. Allocated memory was 201.3 MB in the beginning and 470.8 MB in the end (delta: 269.5 MB). Free memory was 122.7 MB in the beginning and 364.6 MB in the end (delta: -241.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:05,874 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 140.5 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 613.71 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 85.1 MB in the beginning and 166.9 MB in the end (delta: -81.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.74 ms. Allocated memory is still 201.3 MB. Free memory was 166.9 MB in the beginning and 164.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 570.83 ms. Allocated memory is still 201.3 MB. Free memory was 164.4 MB in the beginning and 122.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103663.70 ms. Allocated memory was 201.3 MB in the beginning and 470.8 MB in the end (delta: 269.5 MB). Free memory was 122.7 MB in the beginning and 364.6 MB in the end (delta: -241.8 MB). Peak memory consumption was 27.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...