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-673a906-m [2019-10-02 10:37:19,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:37:19,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:37:19,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:37:19,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:37:19,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:37:19,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:37:19,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:37:19,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:37:19,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:37:19,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:37:19,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:37:19,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:37:19,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:37:19,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:37:19,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:37:19,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:37:19,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:37:19,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:37:19,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:37:19,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:37:19,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:37:19,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:37:19,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:37:19,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:37:19,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:37:19,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:37:19,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:37:19,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:37:19,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:37:19,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:37:19,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:37:19,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:37:19,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:37:19,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:37:19,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:37:19,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:37:19,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:37:19,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:37:19,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:37:19,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:37:19,109 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-10-02 10:37:19,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:37:19,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:37:19,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:37:19,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:37:19,126 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:37:19,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:37:19,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:37:19,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:37:19,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:37:19,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:37:19,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:37:19,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:37:19,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:37:19,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:37:19,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:37:19,128 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:37:19,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:37:19,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:37:19,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:37:19,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:37:19,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:37:19,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:37:19,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:37:19,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:37:19,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:37:19,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:37:19,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:37:19,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:37:19,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:37:19,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:37:19,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:37:19,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:37:19,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:37:19,176 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:37:19,177 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-10-02 10:37:19,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca923af6/f80c72849c094811b0bb95ffae923656/FLAG878b1cede [2019-10-02 10:37:19,825 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:37:19,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-10-02 10:37:19,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca923af6/f80c72849c094811b0bb95ffae923656/FLAG878b1cede [2019-10-02 10:37:20,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca923af6/f80c72849c094811b0bb95ffae923656 [2019-10-02 10:37:20,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:37:20,168 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:37:20,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:37:20,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:37:20,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:37:20,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5127fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20, skipping insertion in model container [2019-10-02 10:37:20,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,180 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:37:20,227 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:37:20,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:37:20,644 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:37:20,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:37:20,781 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:37:20,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20 WrapperNode [2019-10-02 10:37:20,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:37:20,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:37:20,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:37:20,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:37:20,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (1/1) ... [2019-10-02 10:37:20,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:37:20,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:37:20,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:37:20,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:37:20,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (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-10-02 10:37:20,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:37:20,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:37:20,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:37:20,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:37:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 10:37:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:37:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:37:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 10:37:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:37:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:37:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:37:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:37:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:37:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:37:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:37:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:37:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:37:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:37:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:37:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:37:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:37:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:37:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:37:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:37:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:37:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:37:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:37:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:37:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:37:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:37:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:37:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:37:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:37:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:37:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:37:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:37:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:37:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:37:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:37:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:37:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:37:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:37:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:37:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:37:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:37:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:37:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:37:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:37:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:37:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:37:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:37:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:37:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:37:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:37:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:37:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:37:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:37:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 10:37:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:37:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:37:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:37:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 10:37:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:37:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:37:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 10:37:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:37:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:37:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 10:37:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:37:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:37:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:37:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:37:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:37:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:37:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:37:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:37:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:37:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:37:20,909 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:37:20,909 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:37:20,909 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:37:20,909 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:37:20,909 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:37:20,909 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:37:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:37:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:37:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:37:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:37:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:37:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:37:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:37:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:37:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:37:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:37:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:37:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:37:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:37:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:37:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:37:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 10:37:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:37:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:37:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:37:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:37:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:37:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:37:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:37:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:37:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:37:21,260 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 10:37:21,423 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:37:21,423 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 10:37:21,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:37:21 BoogieIcfgContainer [2019-10-02 10:37:21,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:37:21,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:37:21,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:37:21,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:37:21,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:37:20" (1/3) ... [2019-10-02 10:37:21,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b84fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:37:21, skipping insertion in model container [2019-10-02 10:37:21,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:37:20" (2/3) ... [2019-10-02 10:37:21,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b84fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:37:21, skipping insertion in model container [2019-10-02 10:37:21,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:37:21" (3/3) ... [2019-10-02 10:37:21,435 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2019-10-02 10:37:21,446 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:37:21,458 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:37:21,472 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:37:21,498 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:37:21,499 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:37:21,499 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:37:21,499 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:37:21,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:37:21,500 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:37:21,500 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:37:21,500 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:37:21,500 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:37:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-02 10:37:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 10:37:21,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:21,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:37:21,527 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:21,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-10-02 10:37:21,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:21,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:21,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:37:21,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:37:21,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:37:21,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:37:21,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:37:21,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:37:21,699 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-02 10:37:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:21,724 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-10-02 10:37:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:37:21,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-02 10:37:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:21,735 INFO L225 Difference]: With dead ends: 45 [2019-10-02 10:37:21,735 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 10:37:21,739 INFO L640 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-10-02 10:37:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 10:37:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-02 10:37:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-02 10:37:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-02 10:37:21,773 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-10-02 10:37:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:21,774 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-02 10:37:21,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:37:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-02 10:37:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 10:37:21,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:21,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:37:21,775 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:21,776 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-10-02 10:37:21,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:21,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:37:21,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:37:21,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:37:21,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:37:21,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:37:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:37:21,845 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-10-02 10:37:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:21,874 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-10-02 10:37:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:37:21,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-02 10:37:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:21,876 INFO L225 Difference]: With dead ends: 32 [2019-10-02 10:37:21,876 INFO L226 Difference]: Without dead ends: 23 [2019-10-02 10:37:21,878 INFO L640 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-10-02 10:37:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-02 10:37:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-02 10:37:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-02 10:37:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-02 10:37:21,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-10-02 10:37:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:21,884 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-02 10:37:21,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:37:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-02 10:37:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 10:37:21,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:21,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:37:21,885 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-10-02 10:37:21,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:21,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:21,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:37:21,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:37:21,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:37:21,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:37:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:37:21,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:37:21,974 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-10-02 10:37:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:22,021 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-02 10:37:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:37:22,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-02 10:37:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:22,023 INFO L225 Difference]: With dead ends: 43 [2019-10-02 10:37:22,023 INFO L226 Difference]: Without dead ends: 28 [2019-10-02 10:37:22,024 INFO L640 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-10-02 10:37:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-02 10:37:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-02 10:37:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-02 10:37:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-02 10:37:22,032 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-10-02 10:37:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:22,033 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-02 10:37:22,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:37:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-02 10:37:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 10:37:22,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:22,035 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:37:22,035 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-10-02 10:37:22,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:22,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:37:22,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:37:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:37:22,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:37:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:37:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:37:22,198 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2019-10-02 10:37:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:22,243 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-02 10:37:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:37:22,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-02 10:37:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:22,244 INFO L225 Difference]: With dead ends: 36 [2019-10-02 10:37:22,244 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 10:37:22,245 INFO L640 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-10-02 10:37:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 10:37:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-10-02 10:37:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-02 10:37:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-02 10:37:22,250 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-10-02 10:37:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:22,251 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-02 10:37:22,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:37:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-02 10:37:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 10:37:22,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:22,253 INFO L411 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-10-02 10:37:22,253 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-10-02 10:37:22,254 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:22,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:37:22,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:37:22,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:37:22,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:37:22,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:37:22,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:37:22,330 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-10-02 10:37:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:22,396 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-02 10:37:22,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:37:22,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-02 10:37:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:22,397 INFO L225 Difference]: With dead ends: 37 [2019-10-02 10:37:22,398 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 10:37:22,398 INFO L640 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-10-02 10:37:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 10:37:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-02 10:37:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 10:37:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-02 10:37:22,403 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-10-02 10:37:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:22,404 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-02 10:37:22,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:37:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-02 10:37:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 10:37:22,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:22,405 INFO L411 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-10-02 10:37:22,405 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-10-02 10:37:22,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:22,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:22,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:22,491 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-10-02 10:37:22,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:22,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:37:22,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:22,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:37:22,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:22,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 10:37:22,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:37:22,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:37:22,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:37:22,730 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-10-02 10:37:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:22,798 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-10-02 10:37:22,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:37:22,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-02 10:37:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:22,800 INFO L225 Difference]: With dead ends: 54 [2019-10-02 10:37:22,800 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 10:37:22,801 INFO L640 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-10-02 10:37:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 10:37:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-02 10:37:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 10:37:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-02 10:37:22,806 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-10-02 10:37:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:22,807 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-02 10:37:22,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:37:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-02 10:37:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:37:22,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:22,808 INFO L411 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-10-02 10:37:22,808 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:22,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:22,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-10-02 10:37:22,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:22,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:22,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:22,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:22,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:22,917 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-10-02 10:37:22,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:37:23,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:37:23,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:23,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:37:23,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:23,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:23,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 10:37:23,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:37:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:37:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:37:23,089 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-10-02 10:37:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:23,178 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-10-02 10:37:23,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 10:37:23,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-02 10:37:23,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:23,180 INFO L225 Difference]: With dead ends: 59 [2019-10-02 10:37:23,180 INFO L226 Difference]: Without dead ends: 41 [2019-10-02 10:37:23,181 INFO L640 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-10-02 10:37:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-02 10:37:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-10-02 10:37:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-02 10:37:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-02 10:37:23,188 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-10-02 10:37:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:23,188 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-02 10:37:23,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:37:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-02 10:37:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 10:37:23,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:23,190 INFO L411 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-10-02 10:37:23,190 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-10-02 10:37:23,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:23,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:23,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:37:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:23,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:23,308 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-10-02 10:37:23,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:37:23,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:37:23,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:23,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 10:37:23,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:23,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:23,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 10:37:23,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:37:23,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:37:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:37:23,497 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 8 states. [2019-10-02 10:37:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:23,612 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-10-02 10:37:23,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 10:37:23,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-10-02 10:37:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:23,614 INFO L225 Difference]: With dead ends: 64 [2019-10-02 10:37:23,615 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 10:37:23,617 INFO L640 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-10-02 10:37:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 10:37:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-10-02 10:37:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 10:37:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-02 10:37:23,628 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-10-02 10:37:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:23,628 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-02 10:37:23,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:37:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-02 10:37:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 10:37:23,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:23,632 INFO L411 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-10-02 10:37:23,632 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-10-02 10:37:23,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:23,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:23,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:37:23,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:23,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:23,772 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-10-02 10:37:23,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:37:23,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:37:23,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:23,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-02 10:37:23,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:23,947 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-10-02 10:37:23,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:23,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:23,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:37:23,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:37:24,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:24,030 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-10-02 10:37:24,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,065 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-02 10:37:24,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-02 10:37:24,145 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-10-02 10:37:24,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:24,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-10-02 10:37:24,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:24,249 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-10-02 10:37:24,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,317 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-10-02 10:37:24,354 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-02 10:37:24,355 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-10-02 10:37:24,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,399 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-10-02 10:37:24,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,401 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-10-02 10:37:24,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:24,517 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-10-02 10:37:24,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:24,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,581 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-10-02 10:37:24,583 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-10-02 10:37:24,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-10-02 10:37:24,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:24,723 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-10-02 10:37:24,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:24,818 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-10-02 10:37:24,887 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-10-02 10:37:24,888 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-10-02 10:37:24,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:24,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:24,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:24,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:24,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:24,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:24,898 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:37:24,979 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-10-02 10:37:24,981 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-10-02 10:37:24,981 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-10-02 10:37:25,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:25,108 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-10-02 10:37:25,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-10-02 10:37:25,228 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-02 10:37:25,229 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-10-02 10:37:25,230 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-10-02 10:37:25,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-10-02 10:37:25,335 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:25,336 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-10-02 10:37:25,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:25,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:25,509 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-10-02 10:37:25,510 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-10-02 10:37:25,510 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-10-02 10:37:25,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,550 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:37:25,646 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-10-02 10:37:25,648 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-10-02 10:37:25,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-10-02 10:37:25,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:25,807 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-10-02 10:37:25,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:25,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:25,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-10-02 10:37:26,056 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-10-02 10:37:26,057 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-10-02 10:37:26,059 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-10-02 10:37:26,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-10-02 10:37:26,133 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-10-02 10:37:26,138 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:37:26,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:26,643 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-10-02 10:37:26,644 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-10-02 10:37:26,644 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-10-02 10:37:26,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:26,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:37:26,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-10-02 10:37:27,500 WARN L191 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-10-02 10:37:27,500 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-10-02 10:37:27,503 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-10-02 10:37:27,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-10-02 10:37:27,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:27,661 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-10-02 10:37:27,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:27,708 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 10:37:27,780 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-10-02 10:37:27,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:37:27,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-10-02 10:37:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:37:27,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:27,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-10-02 10:37:27,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 10:37:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 10:37:27,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-02 10:37:27,830 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 21 states. [2019-10-02 10:37:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:29,021 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-10-02 10:37:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 10:37:29,021 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-10-02 10:37:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:29,023 INFO L225 Difference]: With dead ends: 75 [2019-10-02 10:37:29,023 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 10:37:29,024 INFO L640 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-10-02 10:37:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 10:37:29,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-02 10:37:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 10:37:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-02 10:37:29,030 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-10-02 10:37:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:29,030 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-02 10:37:29,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 10:37:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-02 10:37:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 10:37:29,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:29,031 INFO L411 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-10-02 10:37:29,032 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-10-02 10:37:29,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:29,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:29,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:37:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:29,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:29,109 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-10-02 10:37:29,187 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 10:37:29,371 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 10:37:29,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:29,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 10:37:29,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:29,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:29,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 10:37:29,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 10:37:29,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 10:37:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:37:29,405 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2019-10-02 10:37:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:29,548 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-10-02 10:37:29,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 10:37:29,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-10-02 10:37:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:29,552 INFO L225 Difference]: With dead ends: 74 [2019-10-02 10:37:29,552 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 10:37:29,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-10-02 10:37:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 10:37:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-10-02 10:37:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 10:37:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-02 10:37:29,567 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-10-02 10:37:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:29,568 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-02 10:37:29,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 10:37:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-02 10:37:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 10:37:29,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:29,570 INFO L411 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-10-02 10:37:29,571 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-10-02 10:37:29,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:29,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:37:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:29,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:29,705 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-10-02 10:37:29,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 10:37:30,115 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 10:37:30,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:30,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 10:37:30,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:30,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:30,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 10:37:30,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 10:37:30,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 10:37:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:37:30,153 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 11 states. [2019-10-02 10:37:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:30,310 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-10-02 10:37:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 10:37:30,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-02 10:37:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:30,312 INFO L225 Difference]: With dead ends: 79 [2019-10-02 10:37:30,312 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 10:37:30,313 INFO L640 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-10-02 10:37:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 10:37:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-10-02 10:37:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 10:37:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-02 10:37:30,319 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-10-02 10:37:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:30,320 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-02 10:37:30,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 10:37:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-02 10:37:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 10:37:30,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:30,321 INFO L411 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-10-02 10:37:30,321 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:30,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:30,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-10-02 10:37:30,322 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:30,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:30,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:37:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:30,455 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-10-02 10:37:30,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:30,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 10:37:30,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:30,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:37:30,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:30,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 10:37:30,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 10:37:30,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 10:37:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-10-02 10:37:30,603 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 12 states. [2019-10-02 10:37:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:30,769 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-02 10:37:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 10:37:30,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-10-02 10:37:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:30,777 INFO L225 Difference]: With dead ends: 84 [2019-10-02 10:37:30,777 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 10:37:30,778 INFO L640 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-10-02 10:37:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 10:37:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-10-02 10:37:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 10:37:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-02 10:37:30,787 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-10-02 10:37:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:30,787 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-02 10:37:30,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 10:37:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-02 10:37:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 10:37:30,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:30,791 INFO L411 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-10-02 10:37:30,791 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-10-02 10:37:30,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:30,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:30,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:37:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:30,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:30,953 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-10-02 10:37:31,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:37:31,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:37:31,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:31,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 10:37:31,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:31,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:31,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:31,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-02 10:37:31,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 10:37:31,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 10:37:31,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-02 10:37:31,119 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 13 states. [2019-10-02 10:37:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:31,286 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-10-02 10:37:31,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 10:37:31,287 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-10-02 10:37:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:31,288 INFO L225 Difference]: With dead ends: 89 [2019-10-02 10:37:31,288 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 10:37:31,289 INFO L640 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-10-02 10:37:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 10:37:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-10-02 10:37:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-02 10:37:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-02 10:37:31,296 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-10-02 10:37:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:31,297 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-02 10:37:31,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 10:37:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-02 10:37:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 10:37:31,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:31,298 INFO L411 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-10-02 10:37:31,298 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-10-02 10:37:31,298 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:31,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:31,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:31,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:37:31,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:37:31,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:31,441 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-10-02 10:37:31,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:37:32,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 10:37:32,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:32,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 10:37:32,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:32,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:37:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:37:32,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:37:32,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 10:37:32,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 10:37:32,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 10:37:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-10-02 10:37:32,739 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2019-10-02 10:37:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:37:32,925 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-10-02 10:37:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 10:37:32,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-10-02 10:37:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:37:32,927 INFO L225 Difference]: With dead ends: 94 [2019-10-02 10:37:32,928 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 10:37:32,929 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2019-10-02 10:37:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 10:37:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-10-02 10:37:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-02 10:37:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-02 10:37:32,935 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-10-02 10:37:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:37:32,935 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-02 10:37:32,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 10:37:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-02 10:37:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 10:37:32,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:37:32,937 INFO L411 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-10-02 10:37:32,937 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:37:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:37:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-10-02 10:37:32,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:37:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:37:32,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:32,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:37:32,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:37:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:37:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 10:37:33,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:37:33,572 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-10-02 10:37:33,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:37:33,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:37:33,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:37:33,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 120 conjunts are in the unsatisfiable core [2019-10-02 10:37:33,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:37:33,857 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-10-02 10:37:33,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:33,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:33,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:37:33,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:37:33,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:33,904 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-10-02 10:37:33,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:33,941 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-10-02 10:37:33,947 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-10-02 10:37:33,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:33,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:33,965 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-10-02 10:37:33,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-10-02 10:37:34,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:37:34,010 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-10-02 10:37:34,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-02 10:37:34,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,084 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-10-02 10:37:34,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,132 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-10-02 10:37:34,136 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-10-02 10:37:34,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,154 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-10-02 10:37:34,155 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-10-02 10:37:34,203 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-10-02 10:37:34,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,219 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-10-02 10:37:34,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-10-02 10:37:34,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,308 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-10-02 10:37:34,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,390 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-10-02 10:37:34,395 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-10-02 10:37:34,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,424 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-10-02 10:37:34,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-10-02 10:37:34,473 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-10-02 10:37:34,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,501 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-10-02 10:37:34,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-10-02 10:37:34,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,670 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-10-02 10:37:34,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,787 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-02 10:37:34,788 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-10-02 10:37:34,795 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-10-02 10:37:34,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,839 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-10-02 10:37:34,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-10-02 10:37:34,903 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-10-02 10:37:34,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:34,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:34,940 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-10-02 10:37:34,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-10-02 10:37:35,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:35,118 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-10-02 10:37:35,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:35,337 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-02 10:37:35,338 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-10-02 10:37:35,348 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-10-02 10:37:35,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:35,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:35,441 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-10-02 10:37:35,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-10-02 10:37:35,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-02 10:37:35,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:35,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:35,674 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-10-02 10:37:35,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-10-02 10:37:36,004 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-02 10:37:36,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:36,005 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-10-02 10:37:36,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:36,359 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-10-02 10:37:36,360 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-10-02 10:37:36,374 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-10-02 10:37:36,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:36,503 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-02 10:37:36,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:36,506 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-10-02 10:37:36,506 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-10-02 10:37:37,115 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-10-02 10:37:37,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:37,237 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-02 10:37:37,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:37,240 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-10-02 10:37:37,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-10-02 10:37:41,442 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-02 10:37:41,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:41,445 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-10-02 10:37:41,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:41,755 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-10-02 10:37:41,756 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-10-02 10:37:41,765 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-10-02 10:37:41,766 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:41,892 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-02 10:37:41,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:41,895 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-10-02 10:37:41,895 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-10-02 10:37:44,223 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-10-02 10:37:44,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:44,330 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-02 10:37:44,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:44,332 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-10-02 10:37:44,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-10-02 10:37:49,640 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-02 10:37:49,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:49,641 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-10-02 10:37:49,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:50,037 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-10-02 10:37:50,037 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-10-02 10:37:50,051 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-10-02 10:37:50,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:50,208 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-10-02 10:37:50,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:50,210 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-10-02 10:37:50,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-10-02 10:37:56,164 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-10-02 10:37:56,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:37:56,349 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-02 10:37:56,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:37:56,351 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-10-02 10:37:56,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200 [2019-10-02 10:38:20,298 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-10-02 10:38:20,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:20,300 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-10-02 10:38:20,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:21,105 WARN L191 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2019-10-02 10:38:21,106 INFO L567 ElimStorePlain]: treesize reduction 126, result has 66.7 percent of original size [2019-10-02 10:38:21,121 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-10-02 10:38:21,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:21,445 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-02 10:38:21,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:21,448 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-10-02 10:38:21,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:222, output treesize:241 [2019-10-02 10:38:37,010 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-10-02 10:38:37,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:37,217 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-10-02 10:38:37,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:37,219 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-10-02 10:38:37,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:260, output treesize:241 [2019-10-02 10:39:09,189 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-10-02 10:39:09,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:09,391 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:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) 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:465) 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:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) 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-10-02 10:39:09,401 INFO L168 Benchmark]: Toolchain (without parser) took 109231.46 ms. Allocated memory was 133.2 MB in the beginning and 461.4 MB in the end (delta: 328.2 MB). Free memory was 88.3 MB in the beginning and 74.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 342.4 MB. Max. memory is 7.1 GB. [2019-10-02 10:39:09,402 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-02 10:39:09,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.13 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 88.1 MB in the beginning and 164.5 MB in the end (delta: -76.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2019-10-02 10:39:09,405 INFO L168 Benchmark]: Boogie Preprocessor took 59.18 ms. Allocated memory is still 199.8 MB. Free memory was 164.5 MB in the beginning and 162.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-02 10:39:09,408 INFO L168 Benchmark]: RCFGBuilder took 583.69 ms. Allocated memory is still 199.8 MB. Free memory was 162.0 MB in the beginning and 119.5 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2019-10-02 10:39:09,409 INFO L168 Benchmark]: TraceAbstraction took 107969.58 ms. Allocated memory was 199.8 MB in the beginning and 461.4 MB in the end (delta: 261.6 MB). Free memory was 119.5 MB in the beginning and 74.1 MB in the end (delta: 45.3 MB). Peak memory consumption was 307.0 MB. Max. memory is 7.1 GB. [2019-10-02 10:39:09,411 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.26 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 613.13 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 88.1 MB in the beginning and 164.5 MB in the end (delta: -76.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.18 ms. Allocated memory is still 199.8 MB. Free memory was 164.5 MB in the beginning and 162.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 583.69 ms. Allocated memory is still 199.8 MB. Free memory was 162.0 MB in the beginning and 119.5 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107969.58 ms. Allocated memory was 199.8 MB in the beginning and 461.4 MB in the end (delta: 261.6 MB). Free memory was 119.5 MB in the beginning and 74.1 MB in the end (delta: 45.3 MB). Peak memory consumption was 307.0 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...