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/forester-heap/dll-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:01:24,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:01:24,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:01:24,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:01:24,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:01:24,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:01:24,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:01:24,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:01:24,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:01:24,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:01:24,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:01:24,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:01:24,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:01:24,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:01:24,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:01:24,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:01:24,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:01:24,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:01:24,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:01:24,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:01:24,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:01:24,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:01:24,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:01:24,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:01:24,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:01:24,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:01:24,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:01:24,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:01:24,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:01:24,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:01:24,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:01:24,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:01:24,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:01:24,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:01:24,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:01:24,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:01:24,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:01:24,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:01:24,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:01:24,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:01:24,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:01:24,100 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:01:24,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:01:24,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:01:24,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:01:24,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:01:24,117 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:01:24,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:01:24,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:01:24,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:01:24,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:01:24,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:01:24,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:01:24,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:01:24,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:01:24,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:01:24,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:01:24,119 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:01:24,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:01:24,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:01:24,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:01:24,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:01:24,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:01:24,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:24,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:01:24,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:01:24,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:01:24,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:01:24,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:01:24,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:01:24,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:01:24,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:01:24,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:01:24,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:01:24,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:01:24,172 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:01:24,173 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-09-20 13:01:24,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc83707fb/2994c5f370454063805564ab2285b6d8/FLAG87f1f4d50 [2019-09-20 13:01:24,761 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:01:24,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-09-20 13:01:24,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc83707fb/2994c5f370454063805564ab2285b6d8/FLAG87f1f4d50 [2019-09-20 13:01:25,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc83707fb/2994c5f370454063805564ab2285b6d8 [2019-09-20 13:01:25,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:01:25,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:01:25,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:25,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:01:25,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:01:25,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422b8279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25, skipping insertion in model container [2019-09-20 13:01:25,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,066 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:01:25,112 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:01:25,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:25,563 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:01:25,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:25,672 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:01:25,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25 WrapperNode [2019-09-20 13:01:25,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:25,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:01:25,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:01:25,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:01:25,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:01:25,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:01:25,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:01:25,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:01:25,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:01:25,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:01:25,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:01:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:01:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:01:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:01:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:01:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:01:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:01:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:01:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:01:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:01:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:01:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:01:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:01:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:01:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:01:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:01:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:01:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:01:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:01:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:01:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:01:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:01:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:01:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:01:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:01:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:01:25,815 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:01:25,815 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:01:25,815 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:01:25,815 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:01:25,815 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:01:25,815 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:01:25,815 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:01:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:01:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:01:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:01:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:01:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:01:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:01:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:01:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:01:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:01:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:01:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:01:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:01:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:01:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:01:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:01:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:01:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:01:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:01:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:01:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:01:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:01:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:01:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:01:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:01:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:01:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:01:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:01:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:01:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:01:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:01:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:01:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:01:25,820 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:01:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:01:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:01:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:01:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:01:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:01:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:01:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:01:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:01:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:01:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:01:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:01:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:01:25,823 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:01:25,823 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:01:25,823 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:01:25,823 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:01:25,823 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:01:25,823 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:01:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:01:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:01:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:01:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:01:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:01:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:01:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:01:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:01:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:01:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:01:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:01:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:01:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:01:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:01:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:01:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:01:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:01:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:01:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:01:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:01:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:01:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:01:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:01:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:01:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:01:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:01:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:01:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:01:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:01:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:01:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:01:26,388 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:01:26,388 INFO L283 CfgBuilder]: Removed 9 assume(true) statements. [2019-09-20 13:01:26,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:26 BoogieIcfgContainer [2019-09-20 13:01:26,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:01:26,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:01:26,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:01:26,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:01:26,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:01:25" (1/3) ... [2019-09-20 13:01:26,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e0a58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:26, skipping insertion in model container [2019-09-20 13:01:26,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (2/3) ... [2019-09-20 13:01:26,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e0a58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:26, skipping insertion in model container [2019-09-20 13:01:26,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:26" (3/3) ... [2019-09-20 13:01:26,398 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-09-20 13:01:26,407 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:01:26,415 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-20 13:01:26,431 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-20 13:01:26,460 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:01:26,460 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:01:26,461 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:01:26,461 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:01:26,463 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:01:26,463 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:01:26,464 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:01:26,464 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:01:26,464 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:01:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-20 13:01:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 13:01:26,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:26,489 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:26,491 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-09-20 13:01:26,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:26,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:26,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:26,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:01:26,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:01:26,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:01:26,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:26,683 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-09-20 13:01:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:26,707 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-09-20 13:01:26,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:01:26,708 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 13:01:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:26,717 INFO L225 Difference]: With dead ends: 70 [2019-09-20 13:01:26,718 INFO L226 Difference]: Without dead ends: 30 [2019-09-20 13:01:26,721 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-20 13:01:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-20 13:01:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 13:01:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-20 13:01:26,760 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-09-20 13:01:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:26,761 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-20 13:01:26,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:01:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-20 13:01:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-20 13:01:26,762 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:26,762 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:26,763 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-09-20 13:01:26,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:26,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:26,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:26,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:01:26,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:01:26,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:01:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:26,920 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-09-20 13:01:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,029 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-09-20 13:01:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:01:27,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-20 13:01:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,031 INFO L225 Difference]: With dead ends: 46 [2019-09-20 13:01:27,031 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:01:27,032 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:01:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-09-20 13:01:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 13:01:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-09-20 13:01:27,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-09-20 13:01:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,043 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-09-20 13:01:27,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:01:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-09-20 13:01:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:01:27,046 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,046 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,046 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-09-20 13:01:27,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:27,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:27,124 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2019-09-20 13:01:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,152 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-09-20 13:01:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:27,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-20 13:01:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,156 INFO L225 Difference]: With dead ends: 75 [2019-09-20 13:01:27,157 INFO L226 Difference]: Without dead ends: 53 [2019-09-20 13:01:27,157 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-20 13:01:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-09-20 13:01:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-20 13:01:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-09-20 13:01:27,166 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-09-20 13:01:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,166 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-09-20 13:01:27,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-09-20 13:01:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:01:27,167 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,167 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,168 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-09-20 13:01:27,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:27,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:27,238 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 3 states. [2019-09-20 13:01:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,257 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-09-20 13:01:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:27,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:01:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,259 INFO L225 Difference]: With dead ends: 42 [2019-09-20 13:01:27,259 INFO L226 Difference]: Without dead ends: 40 [2019-09-20 13:01:27,259 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-20 13:01:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-20 13:01:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:01:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-09-20 13:01:27,266 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-09-20 13:01:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,266 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-09-20 13:01:27,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-09-20 13:01:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:01:27,268 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,268 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,268 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-09-20 13:01:27,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:01:27,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:01:27,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:01:27,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:27,486 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-09-20 13:01:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,695 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-09-20 13:01:27,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:01:27,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-20 13:01:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,697 INFO L225 Difference]: With dead ends: 51 [2019-09-20 13:01:27,697 INFO L226 Difference]: Without dead ends: 38 [2019-09-20 13:01:27,698 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:01:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-20 13:01:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-20 13:01:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:01:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-09-20 13:01:27,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-09-20 13:01:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,704 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-09-20 13:01:27,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:01:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-09-20 13:01:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:01:27,705 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,705 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,705 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-09-20 13:01:27,706 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:27,804 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:27,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 13:01:27,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:27,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:27,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:27,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:27,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:27,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:01:28,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:28,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:01:28,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:28,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:28,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:28,099 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-09-20 13:01:28,100 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 2 case distinctions, treesize of input 67 treesize of output 51 [2019-09-20 13:01:28,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:28,138 INFO L567 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-09-20 13:01:28,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:28,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:32 [2019-09-20 13:01:30,183 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-20 13:01:30,276 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-09-20 13:01:30,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 41 [2019-09-20 13:01:30,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:30,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:30,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:30,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-09-20 13:01:32,352 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_22|]} [2019-09-20 13:01:32,362 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:32,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-09-20 13:01:32,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:32,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:32,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,419 INFO L567 ElimStorePlain]: treesize reduction 19, result has 32.1 percent of original size [2019-09-20 13:01:32,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-09-20 13:01:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-09-20 13:01:32,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:01:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:01:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2019-09-20 13:01:32,429 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2019-09-20 13:01:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:42,619 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-20 13:01:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:01:42,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-20 13:01:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:42,620 INFO L225 Difference]: With dead ends: 65 [2019-09-20 13:01:42,620 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 13:01:42,621 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=26, Invalid=45, Unknown=1, NotChecked=0, Total=72 [2019-09-20 13:01:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 13:01:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-09-20 13:01:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-20 13:01:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-09-20 13:01:42,628 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2019-09-20 13:01:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:42,629 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-09-20 13:01:42,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:01:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-09-20 13:01:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:01:42,630 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:42,630 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:42,631 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2111834143, now seen corresponding path program 1 times [2019-09-20 13:01:42,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:42,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:42,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:42,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:42,682 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 3 states. [2019-09-20 13:01:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:42,712 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-09-20 13:01:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:42,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:01:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:42,714 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:01:42,714 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 13:01:42,715 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 13:01:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-09-20 13:01:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 13:01:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-09-20 13:01:42,723 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 21 [2019-09-20 13:01:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:42,723 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-09-20 13:01:42,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-09-20 13:01:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:01:42,724 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:42,725 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:42,725 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2016892268, now seen corresponding path program 1 times [2019-09-20 13:01:42,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:42,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:42,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:43,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:43,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:43,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-20 13:01:43,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:43,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:43,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,238 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 13 treesize of output 9 [2019-09-20 13:01:43,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-09-20 13:01:43,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:01:43,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,375 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_24|, |v_#memory_int_25|], 8=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_20|]} [2019-09-20 13:01:43,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,419 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 25 treesize of output 13 [2019-09-20 13:01:43,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,498 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 0 case distinctions, treesize of input 25 treesize of output 13 [2019-09-20 13:01:43,499 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,557 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 25 treesize of output 13 [2019-09-20 13:01:43,558 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,628 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 1 case distinctions, treesize of input 63 treesize of output 49 [2019-09-20 13:01:43,629 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,704 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.2 percent of original size [2019-09-20 13:01:43,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,729 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-09-20 13:01:43,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 25 [2019-09-20 13:01:43,730 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,755 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:245, output treesize:59 [2019-09-20 13:01:43,804 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 12=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_21|]} [2019-09-20 13:01:43,811 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 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-20 13:01:43,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-09-20 13:01:43,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:43,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-09-20 13:01:43,916 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:43,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:43,938 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:110, output treesize:68 [2019-09-20 13:01:44,002 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_28|], 6=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_22|]} [2019-09-20 13:01:44,008 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-09-20 13:01:44,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 127 [2019-09-20 13:01:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:44,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2019-09-20 13:01:44,266 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-20 13:01:44,267 INFO L567 ElimStorePlain]: treesize reduction 1277, result has 8.0 percent of original size [2019-09-20 13:01:44,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 69 [2019-09-20 13:01:44,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:44,306 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:83 [2019-09-20 13:01:44,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:44,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-20 13:01:44,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:01:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:01:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:01:44,382 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 12 states. [2019-09-20 13:01:45,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:45,009 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-09-20 13:01:45,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:01:45,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-09-20 13:01:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:45,011 INFO L225 Difference]: With dead ends: 86 [2019-09-20 13:01:45,011 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:01:45,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:01:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:01:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-09-20 13:01:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 13:01:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-09-20 13:01:45,032 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 23 [2019-09-20 13:01:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:45,034 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-09-20 13:01:45,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:01:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-09-20 13:01:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:01:45,036 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:45,036 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:45,036 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash -148911397, now seen corresponding path program 2 times [2019-09-20 13:01:45,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:45,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:45,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:45,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:45,166 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:01:45,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:01:45,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:45,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 13:01:45,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:45,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:45,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:45,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:01:45,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,412 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.4 percent of original size [2019-09-20 13:01:45,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,455 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-09-20 13:01:45,456 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 2 case distinctions, treesize of input 67 treesize of output 51 [2019-09-20 13:01:45,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,494 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2019-09-20 13:01:45,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:45,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:45 [2019-09-20 13:01:47,519 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-20 13:01:47,563 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-09-20 13:01:47,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 41 [2019-09-20 13:01:47,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:36 [2019-09-20 13:01:49,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-20 13:01:49,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,841 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-20 13:01:49,841 INFO L341 Elim1Store]: treesize reduction 25, result has 86.0 percent of original size [2019-09-20 13:01:49,842 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 5 case distinctions, treesize of input 179 treesize of output 206 [2019-09-20 13:01:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:01:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:01:49,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:49,912 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,027 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-09-20 13:01:50,028 INFO L567 ElimStorePlain]: treesize reduction 148, result has 28.5 percent of original size [2019-09-20 13:01:50,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:210, output treesize:93 [2019-09-20 13:01:50,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:50,260 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-20 13:01:50,260 INFO L341 Elim1Store]: treesize reduction 48, result has 59.7 percent of original size [2019-09-20 13:01:50,261 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 106 [2019-09-20 13:01:50,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,276 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:50,521 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-20 13:01:50,522 INFO L341 Elim1Store]: treesize reduction 76, result has 63.8 percent of original size [2019-09-20 13:01:50,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 175 [2019-09-20 13:01:50,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,539 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,685 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-09-20 13:01:50,685 INFO L567 ElimStorePlain]: treesize reduction 136, result has 42.4 percent of original size [2019-09-20 13:01:50,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,687 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:192, output treesize:50 [2019-09-20 13:01:50,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,834 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 20=[|v_#memory_$Pointer$.base_30|]} [2019-09-20 13:01:50,837 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,840 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,878 INFO L567 ElimStorePlain]: treesize reduction 139, result has 44.0 percent of original size [2019-09-20 13:01:50,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 90 [2019-09-20 13:01:50,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,915 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,937 INFO L567 ElimStorePlain]: treesize reduction 39, result has 30.4 percent of original size [2019-09-20 13:01:50,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,938 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:266, output treesize:4 [2019-09-20 13:01:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:50,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:50,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-20 13:01:50,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:01:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:01:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=59, Unknown=3, NotChecked=0, Total=90 [2019-09-20 13:01:50,948 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 10 states. [2019-09-20 13:02:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:01,220 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-09-20 13:02:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:02:01,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-09-20 13:02:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:01,222 INFO L225 Difference]: With dead ends: 103 [2019-09-20 13:02:01,222 INFO L226 Difference]: Without dead ends: 101 [2019-09-20 13:02:01,223 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=46, Invalid=107, Unknown=3, NotChecked=0, Total=156 [2019-09-20 13:02:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-20 13:02:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2019-09-20 13:02:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-20 13:02:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2019-09-20 13:02:01,232 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 23 [2019-09-20 13:02:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:01,233 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2019-09-20 13:02:01,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:02:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2019-09-20 13:02:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:02:01,234 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:01,234 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:01,235 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:01,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1680620617, now seen corresponding path program 2 times [2019-09-20 13:02:01,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:01,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:01,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:01,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:01,690 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:01,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:01,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:01,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-20 13:02:01,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:01,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:01,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:02:01,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:01,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,990 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-20 13:02:01,990 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.4 percent of original size [2019-09-20 13:02:01,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:01,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:02,011 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-09-20 13:02:02,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 25 [2019-09-20 13:02:02,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,060 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-09-20 13:02:02,060 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,114 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-09-20 13:02:02,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,115 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:63 [2019-09-20 13:02:02,153 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 12=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_32|]} [2019-09-20 13:02:02,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:02:02,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-09-20 13:02:02,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-09-20 13:02:02,261 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,291 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:72 [2019-09-20 13:02:02,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-20 13:02:02,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,722 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-09-20 13:02:02,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,725 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|, |v_#memory_int_32|], 2=[|v_#memory_int_30|], 24=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_33|]} [2019-09-20 13:02:02,734 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:02,974 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-20 13:02:02,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26 [2019-09-20 13:02:03,026 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,156 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-20 13:02:03,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-20 13:02:03,171 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,271 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-20 13:02:03,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:03,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 72 [2019-09-20 13:02:03,307 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,419 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-20 13:02:03,419 INFO L567 ElimStorePlain]: treesize reduction 16, result has 94.4 percent of original size [2019-09-20 13:02:03,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 185 treesize of output 158 [2019-09-20 13:02:03,481 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,597 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-20 13:02:03,598 INFO L567 ElimStorePlain]: treesize reduction 114, result has 51.9 percent of original size [2019-09-20 13:02:03,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,600 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:446, output treesize:109 [2019-09-20 13:02:03,666 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 25=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_26|]} [2019-09-20 13:02:03,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,674 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 25 treesize of output 24 [2019-09-20 13:02:03,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 108 [2019-09-20 13:02:03,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,876 INFO L567 ElimStorePlain]: treesize reduction 72, result has 65.6 percent of original size [2019-09-20 13:02:03,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 63 treesize of output 59 [2019-09-20 13:02:03,893 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,934 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:160, output treesize:118 [2019-09-20 13:02:04,002 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_34|], 4=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_27|]} [2019-09-20 13:02:04,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:04,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 30 [2019-09-20 13:02:04,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 207 treesize of output 152 [2019-09-20 13:02:04,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,118 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:04,214 INFO L567 ElimStorePlain]: treesize reduction 96, result has 65.2 percent of original size [2019-09-20 13:02:04,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:04,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:04,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 87 treesize of output 75 [2019-09-20 13:02:04,236 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:04,265 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:263, output treesize:190 [2019-09-20 13:02:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:04,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:04,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-09-20 13:02:04,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:02:04,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:02:04,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:02:04,347 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 13 states. [2019-09-20 13:02:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:04,875 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2019-09-20 13:02:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:02:04,876 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-09-20 13:02:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:04,878 INFO L225 Difference]: With dead ends: 118 [2019-09-20 13:02:04,878 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 13:02:04,879 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:02:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 13:02:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-09-20 13:02:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-20 13:02:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-09-20 13:02:04,890 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 29 [2019-09-20 13:02:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:04,892 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-09-20 13:02:04,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:02:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2019-09-20 13:02:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:02:04,894 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:04,894 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:04,894 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash -746365808, now seen corresponding path program 3 times [2019-09-20 13:02:04,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:04,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:04,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:04,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:05,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:05,065 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:05,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:02:05,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:02:05,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:05,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-20 13:02:05,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:05,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:05,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:02:05,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:05,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,572 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2019-09-20 13:02:05,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,619 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-09-20 13:02:05,619 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 2 case distinctions, treesize of input 67 treesize of output 51 [2019-09-20 13:02:05,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,661 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.0 percent of original size [2019-09-20 13:02:05,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:05,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:48 [2019-09-20 13:02:05,730 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-09-20 13:02:05,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 41 [2019-09-20 13:02:05,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:05,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:56 [2019-09-20 13:02:05,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,006 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 277 treesize of output 340 [2019-09-20 13:02:10,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,066 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 266 treesize of output 329 [2019-09-20 13:02:10,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,402 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-20 13:02:10,403 INFO L567 ElimStorePlain]: treesize reduction 80, result has 87.4 percent of original size [2019-09-20 13:02:10,404 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|], 38=[|v_#memory_$Pointer$.base_38|]} [2019-09-20 13:02:10,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:10,409 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:10,419 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,553 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-20 13:02:10,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 209 [2019-09-20 13:02:10,672 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:10,814 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-20 13:02:10,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 216 treesize of output 289 [2019-09-20 13:02:10,817 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,110 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-09-20 13:02:11,111 INFO L567 ElimStorePlain]: treesize reduction 454, result has 30.8 percent of original size [2019-09-20 13:02:11,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-09-20 13:02:11,114 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:544, output treesize:196 [2019-09-20 13:02:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,456 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-20 13:02:11,456 INFO L341 Elim1Store]: treesize reduction 24, result has 69.2 percent of original size [2019-09-20 13:02:11,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 129 [2019-09-20 13:02:11,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,604 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-20 13:02:11,605 INFO L341 Elim1Store]: treesize reduction 52, result has 65.6 percent of original size [2019-09-20 13:02:11,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 175 [2019-09-20 13:02:11,607 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.