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-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:06:48,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:06:48,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:06:48,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:06:48,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:06:48,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:06:48,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:06:48,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:06:48,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:06:48,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:06:48,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:06:48,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:06:48,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:06:48,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:06:48,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:06:48,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:06:48,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:06:48,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:06:48,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:06:48,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:06:48,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:06:48,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:06:48,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:06:48,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:06:48,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:06:48,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:06:48,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:06:48,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:06:48,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:06:48,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:06:48,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:06:48,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:06:48,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:06:48,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:06:48,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:06:48,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:06:48,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:06:48,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:06:48,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:06:48,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:06:48,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:06:48,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:06:48,202 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:06:48,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:06:48,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:06:48,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:06:48,204 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:06:48,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:06:48,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:06:48,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:06:48,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:06:48,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:06:48,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:06:48,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:06:48,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:06:48,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:06:48,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:06:48,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:06:48,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:06:48,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:06:48,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:06:48,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:06:48,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:06:48,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:06:48,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:06:48,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:06:48,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:06:48,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:06:48,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:06:48,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:06:48,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:06:48,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:06:48,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:06:48,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:06:48,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:06:48,499 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:06:48,500 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-14 22:06:48,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c734c719/fe39b89efed54f04a942a600a326a490/FLAG9bd06752d [2019-10-14 22:06:49,120 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:06:49,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-14 22:06:49,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c734c719/fe39b89efed54f04a942a600a326a490/FLAG9bd06752d [2019-10-14 22:06:49,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c734c719/fe39b89efed54f04a942a600a326a490 [2019-10-14 22:06:49,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:06:49,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:06:49,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:49,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:06:49,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:06:49,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:49" (1/1) ... [2019-10-14 22:06:49,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef90fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:49, skipping insertion in model container [2019-10-14 22:06:49,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:49" (1/1) ... [2019-10-14 22:06:49,448 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:06:49,503 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:06:49,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:49,979 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:06:50,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:50,080 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:06:50,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50 WrapperNode [2019-10-14 22:06:50,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:50,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:06:50,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:06:50,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:06:50,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... [2019-10-14 22:06:50,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... [2019-10-14 22:06:50,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... [2019-10-14 22:06:50,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... [2019-10-14 22:06:50,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... [2019-10-14 22:06:50,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... [2019-10-14 22:06:50,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... [2019-10-14 22:06:50,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:06:50,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:06:50,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:06:50,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:06:50,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:06:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:06:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:06:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:06:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:06:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:06:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:06:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:06:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:06:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:06:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:06:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:06:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:06:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:06:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:06:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:06:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:06:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:06:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:06:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:06:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:06:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:06:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:06:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:06:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:06:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:06:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:06:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:06:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:06:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:06:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:06:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:06:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:06:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:06:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:06:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:06:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:06:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:06:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:06:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:06:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:06:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:06:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:06:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:06:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:06:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:06:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:06:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:06:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:06:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:06:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:06:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:06:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:06:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:06:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:06:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:06:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:06:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:06:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:06:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:06:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:06:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:06:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:06:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:06:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:06:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:06:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:06:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:06:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:06:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:06:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:06:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:06:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:06:50,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:06:50,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:06:50,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:06:50,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:06:50,944 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:06:50,945 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-14 22:06:50,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:50 BoogieIcfgContainer [2019-10-14 22:06:50,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:06:50,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:06:50,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:06:50,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:06:50,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:06:49" (1/3) ... [2019-10-14 22:06:50,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d110d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:50, skipping insertion in model container [2019-10-14 22:06:50,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:50" (2/3) ... [2019-10-14 22:06:50,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d110d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:50, skipping insertion in model container [2019-10-14 22:06:50,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:50" (3/3) ... [2019-10-14 22:06:50,958 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-10-14 22:06:50,968 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:06:50,977 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-14 22:06:50,989 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-14 22:06:51,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:06:51,018 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:06:51,018 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:06:51,018 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:06:51,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:06:51,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:06:51,019 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:06:51,019 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:06:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-10-14 22:06:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-14 22:06:51,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:51,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:51,050 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1255802584, now seen corresponding path program 1 times [2019-10-14 22:06:51,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:51,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367444522] [2019-10-14 22:06:51,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:51,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:51,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:51,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367444522] [2019-10-14 22:06:51,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:51,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:06:51,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591086181] [2019-10-14 22:06:51,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:06:51,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:51,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:06:51,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:06:51,329 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-10-14 22:06:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:51,577 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-10-14 22:06:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:06:51,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-14 22:06:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:51,590 INFO L225 Difference]: With dead ends: 98 [2019-10-14 22:06:51,590 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 22:06:51,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:06:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 22:06:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-14 22:06:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 22:06:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-10-14 22:06:51,637 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2019-10-14 22:06:51,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:51,638 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-10-14 22:06:51,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:06:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-10-14 22:06:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 22:06:51,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:51,639 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:51,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:51,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash -338068956, now seen corresponding path program 1 times [2019-10-14 22:06:51,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:51,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433141097] [2019-10-14 22:06:51,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:51,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:51,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:51,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433141097] [2019-10-14 22:06:51,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:51,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:51,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951771324] [2019-10-14 22:06:51,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:51,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:51,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:51,768 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-10-14 22:06:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:51,966 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-10-14 22:06:51,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:51,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-14 22:06:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:51,968 INFO L225 Difference]: With dead ends: 51 [2019-10-14 22:06:51,968 INFO L226 Difference]: Without dead ends: 49 [2019-10-14 22:06:51,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-14 22:06:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-10-14 22:06:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 22:06:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-14 22:06:51,976 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2019-10-14 22:06:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:51,976 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-14 22:06:51,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-14 22:06:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-14 22:06:51,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:51,977 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:51,978 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1890143313, now seen corresponding path program 1 times [2019-10-14 22:06:51,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:51,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093295706] [2019-10-14 22:06:51,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:51,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:51,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:52,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093295706] [2019-10-14 22:06:52,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:52,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:52,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718041885] [2019-10-14 22:06:52,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:52,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:52,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:52,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:52,081 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 5 states. [2019-10-14 22:06:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:52,270 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-10-14 22:06:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:52,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-14 22:06:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:52,273 INFO L225 Difference]: With dead ends: 43 [2019-10-14 22:06:52,273 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 22:06:52,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 22:06:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-14 22:06:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 22:06:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-14 22:06:52,287 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2019-10-14 22:06:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:52,287 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-14 22:06:52,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-14 22:06:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:06:52,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:52,289 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:52,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash 290038970, now seen corresponding path program 1 times [2019-10-14 22:06:52,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:52,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879659581] [2019-10-14 22:06:52,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:52,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:52,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:52,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879659581] [2019-10-14 22:06:52,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:52,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:06:52,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422207983] [2019-10-14 22:06:52,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:06:52,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:52,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:06:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:06:52,530 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2019-10-14 22:06:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:52,910 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-10-14 22:06:52,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:06:52,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-10-14 22:06:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:52,912 INFO L225 Difference]: With dead ends: 82 [2019-10-14 22:06:52,912 INFO L226 Difference]: Without dead ends: 80 [2019-10-14 22:06:52,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:06:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-14 22:06:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2019-10-14 22:06:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 22:06:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-10-14 22:06:52,928 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 14 [2019-10-14 22:06:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:52,928 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-10-14 22:06:52,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:06:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-10-14 22:06:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 22:06:52,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:52,930 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:52,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2060721718, now seen corresponding path program 1 times [2019-10-14 22:06:52,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:52,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285452768] [2019-10-14 22:06:52,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:52,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:52,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:53,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285452768] [2019-10-14 22:06:53,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:53,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:53,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328693337] [2019-10-14 22:06:53,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:53,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:53,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:53,038 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 5 states. [2019-10-14 22:06:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:53,210 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-10-14 22:06:53,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:53,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-14 22:06:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:53,211 INFO L225 Difference]: With dead ends: 59 [2019-10-14 22:06:53,212 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 22:06:53,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 22:06:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-14 22:06:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 22:06:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-10-14 22:06:53,219 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 15 [2019-10-14 22:06:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:53,219 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-10-14 22:06:53,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-10-14 22:06:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:06:53,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:53,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:53,221 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash 373775322, now seen corresponding path program 1 times [2019-10-14 22:06:53,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:53,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40110188] [2019-10-14 22:06:53,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:53,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40110188] [2019-10-14 22:06:53,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:53,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:53,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224916039] [2019-10-14 22:06:53,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:53,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:53,318 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2019-10-14 22:06:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:53,453 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-10-14 22:06:53,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:53,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-14 22:06:53,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:53,454 INFO L225 Difference]: With dead ends: 57 [2019-10-14 22:06:53,454 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 22:06:53,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 22:06:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-14 22:06:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 22:06:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-10-14 22:06:53,462 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 17 [2019-10-14 22:06:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:53,463 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-10-14 22:06:53,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-10-14 22:06:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 22:06:53,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:53,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:53,464 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1568846049, now seen corresponding path program 1 times [2019-10-14 22:06:53,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:53,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209868653] [2019-10-14 22:06:53,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:53,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209868653] [2019-10-14 22:06:53,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:53,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:06:53,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146864748] [2019-10-14 22:06:53,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:06:53,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:06:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:53,548 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 6 states. [2019-10-14 22:06:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:53,729 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-10-14 22:06:53,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:06:53,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-14 22:06:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:53,730 INFO L225 Difference]: With dead ends: 70 [2019-10-14 22:06:53,731 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 22:06:53,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:06:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 22:06:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-14 22:06:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 22:06:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-14 22:06:53,738 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 18 [2019-10-14 22:06:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:53,738 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-14 22:06:53,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:06:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-14 22:06:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:06:53,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:53,739 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:53,740 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash 777661568, now seen corresponding path program 1 times [2019-10-14 22:06:53,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:53,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775100008] [2019-10-14 22:06:53,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:53,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775100008] [2019-10-14 22:06:53,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934088489] [2019-10-14 22:06:53,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 22:06:53,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:54,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-14 22:06:54,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-14 22:06:54,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-14 22:06:54,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-14 22:06:54,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,151 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-14 22:06:54,151 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-10-14 22:06:54,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-14 22:06:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:54,182 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:54,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-14 22:06:54,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040753765] [2019-10-14 22:06:54,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:06:54,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:06:54,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:06:54,184 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2019-10-14 22:06:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:54,603 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-10-14 22:06:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:06:54,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-14 22:06:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:54,604 INFO L225 Difference]: With dead ends: 79 [2019-10-14 22:06:54,605 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 22:06:54,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:06:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 22:06:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-14 22:06:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 22:06:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-10-14 22:06:54,611 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 21 [2019-10-14 22:06:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:54,612 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-10-14 22:06:54,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:06:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-10-14 22:06:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:06:54,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:54,613 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:54,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:54,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1056872398, now seen corresponding path program 1 times [2019-10-14 22:06:54,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:54,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829409695] [2019-10-14 22:06:54,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:54,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:54,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:55,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829409695] [2019-10-14 22:06:55,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655499905] [2019-10-14 22:06:55,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:55,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 22:06:55,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:55,352 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:06:55,353 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:06:55,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,372 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-10-14 22:06:55,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:55,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-10-14 22:06:55,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:06:55,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,565 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-10-14 22:06:55,581 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:55,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,615 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:55,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:55,658 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:55,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,703 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 1 case distinctions, treesize of input 77 treesize of output 55 [2019-10-14 22:06:55,704 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,748 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-10-14 22:06:55,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,751 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-10-14 22:06:55,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,809 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 16 treesize of output 26 [2019-10-14 22:06:55,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,859 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_39|, |v_#memory_int_40|, |v_#memory_$Pointer$.base_30|, |v_#memory_int_41|], 4=[|v_#memory_int_43|]} [2019-10-14 22:06:55,862 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:55,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,897 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:55,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:55,931 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,956 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:55,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:56,039 INFO L341 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-10-14 22:06:56,040 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 3 case distinctions, treesize of input 57 treesize of output 85 [2019-10-14 22:06:56,040 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:56,093 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-10-14 22:06:56,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:56,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:56,102 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-10-14 22:06:56,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-10-14 22:06:56,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:56,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:56,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:56,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-10-14 22:06:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:56,238 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:56,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-10-14 22:06:56,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731566962] [2019-10-14 22:06:56,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 22:06:56,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:56,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 22:06:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:06:56,240 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2019-10-14 22:06:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:56,955 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-14 22:06:56,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 22:06:56,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-10-14 22:06:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:56,957 INFO L225 Difference]: With dead ends: 89 [2019-10-14 22:06:56,958 INFO L226 Difference]: Without dead ends: 87 [2019-10-14 22:06:56,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:06:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-14 22:06:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2019-10-14 22:06:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 22:06:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-14 22:06:56,964 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2019-10-14 22:06:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:56,965 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-14 22:06:56,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 22:06:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-14 22:06:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:06:56,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:56,966 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:57,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:57,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash -377613816, now seen corresponding path program 1 times [2019-10-14 22:06:57,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:57,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169584516] [2019-10-14 22:06:57,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:57,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:57,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:57,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169584516] [2019-10-14 22:06:57,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127063345] [2019-10-14 22:06:57,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:57,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 22:06:57,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:57,592 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:06:57,593 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:06:57,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:57,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:57,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:57,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-14 22:06:57,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:57,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:06:57,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:57,802 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-14 22:06:57,803 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-14 22:06:57,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:57,816 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:57,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:57,827 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-10-14 22:06:57,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:57,897 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-14 22:06:57,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:57,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:57,926 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 41 [2019-10-14 22:06:57,926 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:57,982 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-14 22:06:57,984 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-10-14 22:06:57,984 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-14 22:06:58,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:58,094 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-10-14 22:06:58,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:58,331 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-14 22:06:58,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:58,334 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|], 11=[|v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.base_32|]} [2019-10-14 22:06:58,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:58,343 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2019-10-14 22:06:58,346 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:58,693 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-14 22:06:58,694 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.4 percent of original size [2019-10-14 22:06:58,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-14 22:06:58,729 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:58,864 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-14 22:06:58,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:58,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:58,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:58,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:58,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:58,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:58,932 INFO L341 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-10-14 22:06:58,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2019-10-14 22:06:58,933 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,046 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-14 22:06:59,047 INFO L567 ElimStorePlain]: treesize reduction 41, result has 86.4 percent of original size [2019-10-14 22:06:59,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,107 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 144 [2019-10-14 22:06:59,109 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,253 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-14 22:06:59,253 INFO L567 ElimStorePlain]: treesize reduction 134, result has 42.7 percent of original size [2019-10-14 22:06:59,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,255 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:97 [2019-10-14 22:06:59,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:59,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2019-10-14 22:06:59,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,549 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-10-14 22:06:59,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:138, output treesize:75 [2019-10-14 22:06:59,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 86 [2019-10-14 22:06:59,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:59,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:59,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:59,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:59,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:59,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:4 [2019-10-14 22:06:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:59,694 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:59,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-14 22:06:59,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741670657] [2019-10-14 22:06:59,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:06:59,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:06:59,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:06:59,696 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 18 states. [2019-10-14 22:07:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:01,322 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-10-14 22:07:01,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 22:07:01,323 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-10-14 22:07:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:01,324 INFO L225 Difference]: With dead ends: 109 [2019-10-14 22:07:01,324 INFO L226 Difference]: Without dead ends: 107 [2019-10-14 22:07:01,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2019-10-14 22:07:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-14 22:07:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-10-14 22:07:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-14 22:07:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-10-14 22:07:01,335 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 32 [2019-10-14 22:07:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:01,335 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-10-14 22:07:01,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:07:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-10-14 22:07:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:01,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:01,336 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:01,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:01,542 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash -243600310, now seen corresponding path program 1 times [2019-10-14 22:07:01,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:01,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319477298] [2019-10-14 22:07:01,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:01,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:01,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:02,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319477298] [2019-10-14 22:07:02,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201576089] [2019-10-14 22:07:02,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:02,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-14 22:07:02,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:02,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:02,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:02,326 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 41 [2019-10-14 22:07:02,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,384 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.2 percent of original size [2019-10-14 22:07:02,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:02,427 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 2 case distinctions, treesize of input 63 treesize of output 65 [2019-10-14 22:07:02,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,495 INFO L567 ElimStorePlain]: treesize reduction 40, result has 59.6 percent of original size [2019-10-14 22:07:02,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:56 [2019-10-14 22:07:02,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,546 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 12=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_34|]} [2019-10-14 22:07:02,558 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 103 treesize of output 99 [2019-10-14 22:07:02,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,567 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 99 treesize of output 95 [2019-10-14 22:07:02,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,751 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-10-14 22:07:02,752 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.5 percent of original size [2019-10-14 22:07:02,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 79 [2019-10-14 22:07:02,779 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:02,806 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 97 [2019-10-14 22:07:02,807 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,950 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-14 22:07:02,950 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.1 percent of original size [2019-10-14 22:07:02,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:02,980 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:02,981 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 78 [2019-10-14 22:07:02,982 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:03,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:03,003 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2019-10-14 22:07:03,004 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:03,115 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-14 22:07:03,116 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.6 percent of original size [2019-10-14 22:07:03,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:03,117 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:203, output treesize:116 [2019-10-14 22:07:03,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:03,517 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 1=[v_prenex_2, v_prenex_3]} [2019-10-14 22:07:03,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 57 treesize of output 45 [2019-10-14 22:07:03,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:03,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:03,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 39 treesize of output 23 [2019-10-14 22:07:03,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:03,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:03,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:03,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 59 [2019-10-14 22:07:03,604 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:03,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:03,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:03,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 47 treesize of output 39 [2019-10-14 22:07:03,648 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:03,698 INFO L567 ElimStorePlain]: treesize reduction 8, result has 83.3 percent of original size [2019-10-14 22:07:03,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-14 22:07:03,700 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:138, output treesize:32 [2019-10-14 22:07:03,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:03,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:03,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:03,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:03,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:03,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:07:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:03,791 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:03,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2019-10-14 22:07:03,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169679905] [2019-10-14 22:07:03,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 22:07:03,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 22:07:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:07:03,793 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 22 states. [2019-10-14 22:07:04,763 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-10-14 22:07:05,221 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-10-14 22:07:05,446 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-14 22:07:05,639 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2019-10-14 22:07:05,822 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-10-14 22:07:06,346 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-10-14 22:07:06,525 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-14 22:07:06,713 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-14 22:07:06,880 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-14 22:07:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:06,992 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2019-10-14 22:07:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 22:07:06,993 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-14 22:07:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:06,997 INFO L225 Difference]: With dead ends: 123 [2019-10-14 22:07:06,997 INFO L226 Difference]: Without dead ends: 111 [2019-10-14 22:07:06,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 22:07:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-14 22:07:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2019-10-14 22:07:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-14 22:07:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2019-10-14 22:07:07,027 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 32 [2019-10-14 22:07:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:07,030 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2019-10-14 22:07:07,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 22:07:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2019-10-14 22:07:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 22:07:07,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:07,033 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:07,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:07,234 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash 145286649, now seen corresponding path program 2 times [2019-10-14 22:07:07,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:07,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502090087] [2019-10-14 22:07:07,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:07,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:07,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:07,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502090087] [2019-10-14 22:07:07,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534532628] [2019-10-14 22:07:07,581 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:07,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:07,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:07,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-14 22:07:07,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:07,740 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:07:07,740 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:07:07,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:07,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:07,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:07,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-14 22:07:07,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:07,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:07,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:07,944 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-14 22:07:07,944 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-14 22:07:07,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:07,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:07,971 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:07,971 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-10-14 22:07:07,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:08,046 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-14 22:07:08,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:08,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,066 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 41 [2019-10-14 22:07:08,067 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:08,134 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-14 22:07:08,134 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-10-14 22:07:08,135 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-14 22:07:08,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,245 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-10-14 22:07:08,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:08,544 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-14 22:07:08,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,548 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|, |v_#memory_int_47|], 2=[|v_#memory_int_45|, |v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_37|], 11=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|]} [2019-10-14 22:07:08,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2019-10-14 22:07:08,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:08,812 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-10-14 22:07:08,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:08,836 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,015 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-14 22:07:09,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,021 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:09,170 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-14 22:07:09,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,192 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 228 treesize of output 231 [2019-10-14 22:07:09,193 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,511 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-10-14 22:07:09,511 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-10-14 22:07:09,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,524 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 1143 treesize of output 691 [2019-10-14 22:07:09,525 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:10,050 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-10-14 22:07:10,051 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.9 percent of original size [2019-10-14 22:07:10,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-14 22:07:10,089 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:10,245 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-14 22:07:10,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:10,477 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-10-14 22:07:10,478 INFO L341 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-10-14 22:07:10,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 6 new quantified variables, introduced 9 case distinctions, treesize of input 579 treesize of output 565 [2019-10-14 22:07:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:10,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:10,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:10,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:10,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:10,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:10,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:10,532 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 21 xjuncts. [2019-10-14 22:07:11,367 WARN L191 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 58 [2019-10-14 22:07:11,368 INFO L567 ElimStorePlain]: treesize reduction 28306, result has 1.4 percent of original size [2019-10-14 22:07:11,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:11,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:11,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:11,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 111 [2019-10-14 22:07:11,388 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:11,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:11,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:11,421 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:102 [2019-10-14 22:07:11,520 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-10-14 22:07:11,531 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:11,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 71 [2019-10-14 22:07:11,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:11,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:11,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:11,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:11,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:11,535 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:11,573 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-10-14 22:07:11,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:11,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-10-14 22:07:11,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:11,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:11,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:11,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-10-14 22:07:11,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:11,622 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-10-14 22:07:11,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:11,630 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-10-14 22:07:11,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:11,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-14 22:07:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:11,662 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:11,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-14 22:07:11,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814772807] [2019-10-14 22:07:11,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:11,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:11,664 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 15 states. [2019-10-14 22:07:12,532 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-14 22:07:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:12,971 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2019-10-14 22:07:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:12,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-10-14 22:07:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:12,973 INFO L225 Difference]: With dead ends: 131 [2019-10-14 22:07:12,973 INFO L226 Difference]: Without dead ends: 119 [2019-10-14 22:07:12,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-14 22:07:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2019-10-14 22:07:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-14 22:07:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-10-14 22:07:12,984 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 35 [2019-10-14 22:07:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:12,984 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-10-14 22:07:12,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:07:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-10-14 22:07:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 22:07:12,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:12,986 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:13,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:13,190 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:13,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:13,191 INFO L82 PathProgramCache]: Analyzing trace with hash -969799515, now seen corresponding path program 1 times [2019-10-14 22:07:13,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:13,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166983377] [2019-10-14 22:07:13,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:13,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:13,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:13,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166983377] [2019-10-14 22:07:13,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588932559] [2019-10-14 22:07:13,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:13,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-14 22:07:13,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:13,639 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:07:13,639 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:07:13,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:13,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-14 22:07:13,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:13,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,804 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-14 22:07:13,805 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-14 22:07:13,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,816 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:13,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,829 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 41 [2019-10-14 22:07:13,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,901 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-14 22:07:13,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,923 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-10-14 22:07:13,923 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,987 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-14 22:07:13,988 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-10-14 22:07:13,988 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-14 22:07:14,131 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,132 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-10-14 22:07:14,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,316 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-14 22:07:14,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,320 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_49|], 6=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_40|], 11=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_40|]} [2019-10-14 22:07:14,337 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 165 treesize of output 109 [2019-10-14 22:07:14,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,489 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-14 22:07:14,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,503 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 1033 treesize of output 625 [2019-10-14 22:07:14,505 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,689 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-14 22:07:14,689 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-10-14 22:07:14,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-14 22:07:14,712 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:14,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:14,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:14,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:14,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 613 treesize of output 434 [2019-10-14 22:07:14,802 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,878 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 129 treesize of output 134 [2019-10-14 22:07:14,879 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,963 INFO L567 ElimStorePlain]: treesize reduction 124, result has 42.3 percent of original size [2019-10-14 22:07:14,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:14,965 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:1110, output treesize:91 [2019-10-14 22:07:15,197 INFO L392 ElimStorePlain]: Different costs {10=[|#memory_$Pointer$.base|], 14=[|#memory_$Pointer$.offset|]} [2019-10-14 22:07:15,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 126 [2019-10-14 22:07:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,258 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:15,321 INFO L567 ElimStorePlain]: treesize reduction 61, result has 53.1 percent of original size [2019-10-14 22:07:15,335 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2019-10-14 22:07:15,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:163, output treesize:11 [2019-10-14 22:07:15,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:15,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:07:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:15,407 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:15,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-14 22:07:15,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410400239] [2019-10-14 22:07:15,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:07:15,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:07:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=233, Unknown=1, NotChecked=0, Total=272 [2019-10-14 22:07:15,409 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 17 states. [2019-10-14 22:07:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:17,237 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-10-14 22:07:17,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:07:17,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-10-14 22:07:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:17,239 INFO L225 Difference]: With dead ends: 126 [2019-10-14 22:07:17,239 INFO L226 Difference]: Without dead ends: 124 [2019-10-14 22:07:17,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=587, Unknown=1, NotChecked=0, Total=702 [2019-10-14 22:07:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-14 22:07:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2019-10-14 22:07:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-14 22:07:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-10-14 22:07:17,249 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 35 [2019-10-14 22:07:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:17,249 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-10-14 22:07:17,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:07:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-10-14 22:07:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 22:07:17,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:17,251 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:17,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:17,455 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 4024618, now seen corresponding path program 2 times [2019-10-14 22:07:17,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:17,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951298563] [2019-10-14 22:07:17,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:17,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:17,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:07:17,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951298563] [2019-10-14 22:07:17,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427137226] [2019-10-14 22:07:17,694 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:17,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:17,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:17,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-14 22:07:17,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:17,846 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:07:17,846 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:07:17,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:17,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-14 22:07:17,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,994 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-10-14 22:07:17,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:18,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,056 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-10-14 22:07:18,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,129 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.7 percent of original size [2019-10-14 22:07:18,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,153 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,154 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 41 [2019-10-14 22:07:18,155 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,221 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.7 percent of original size [2019-10-14 22:07:18,222 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-10-14 22:07:18,222 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:197, output treesize:68 [2019-10-14 22:07:18,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,290 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 45 treesize of output 35 [2019-10-14 22:07:18,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,343 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 3 case distinctions, treesize of input 64 treesize of output 53 [2019-10-14 22:07:18,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,399 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2019-10-14 22:07:18,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:56 [2019-10-14 22:07:18,620 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-14 22:07:18,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 53 [2019-10-14 22:07:18,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,622 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:18,651 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.3 percent of original size [2019-10-14 22:07:18,664 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 32 [2019-10-14 22:07:18,666 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:10 [2019-10-14 22:07:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:07:18,693 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:18,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-10-14 22:07:18,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451103431] [2019-10-14 22:07:18,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:07:18,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:18,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:07:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:07:18,694 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 18 states. [2019-10-14 22:07:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:19,530 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-10-14 22:07:19,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:07:19,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-10-14 22:07:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:19,531 INFO L225 Difference]: With dead ends: 124 [2019-10-14 22:07:19,531 INFO L226 Difference]: Without dead ends: 98 [2019-10-14 22:07:19,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:07:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-14 22:07:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-10-14 22:07:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-14 22:07:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-10-14 22:07:19,541 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 38 [2019-10-14 22:07:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:19,541 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-10-14 22:07:19,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:07:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-10-14 22:07:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 22:07:19,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:19,546 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:19,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:19,753 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:19,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash -233815650, now seen corresponding path program 1 times [2019-10-14 22:07:19,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:19,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866451023] [2019-10-14 22:07:19,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:19,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:19,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:20,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866451023] [2019-10-14 22:07:20,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827841183] [2019-10-14 22:07:20,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:20,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-14 22:07:20,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:20,156 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:07:20,156 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:07:20,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:20,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-14 22:07:20,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:20,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,345 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-14 22:07:20,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:20,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:20,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,377 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-10-14 22:07:20,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,449 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-14 22:07:20,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:20,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,467 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 41 [2019-10-14 22:07:20,467 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,533 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-14 22:07:20,534 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-10-14 22:07:20,535 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-14 22:07:20,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,625 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-10-14 22:07:20,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,790 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-14 22:07:20,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,792 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|], 11=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-10-14 22:07:20,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,824 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2019-10-14 22:07:20,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:21,117 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-14 22:07:21,117 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.4 percent of original size [2019-10-14 22:07:21,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-14 22:07:21,146 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:21,307 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-14 22:07:21,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:21,562 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-10-14 22:07:21,562 INFO L341 Elim1Store]: treesize reduction 250, result has 36.9 percent of original size [2019-10-14 22:07:21,563 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 9 case distinctions, treesize of input 327 treesize of output 281 [2019-10-14 22:07:21,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:21,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:21,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:21,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:21,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:21,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:21,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:21,579 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:21,794 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-14 22:07:21,795 INFO L567 ElimStorePlain]: treesize reduction 118, result has 59.2 percent of original size [2019-10-14 22:07:21,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:21,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:21,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:21,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:21,851 INFO L341 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-10-14 22:07:21,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 89 [2019-10-14 22:07:21,853 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:21,936 INFO L567 ElimStorePlain]: treesize reduction 41, result has 68.0 percent of original size [2019-10-14 22:07:21,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:21,937 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:121 [2019-10-14 22:07:22,828 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-14 22:07:22,829 INFO L341 Elim1Store]: treesize reduction 16, result has 87.5 percent of original size [2019-10-14 22:07:22,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 180 treesize of output 195 [2019-10-14 22:07:22,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:22,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:23,134 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:23,264 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-10-14 22:07:23,264 INFO L567 ElimStorePlain]: treesize reduction 137, result has 34.8 percent of original size [2019-10-14 22:07:23,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:23,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 57 [2019-10-14 22:07:23,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:23,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:23,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:23,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:190, output treesize:10 [2019-10-14 22:07:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:23,368 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:23,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-14 22:07:23,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598206004] [2019-10-14 22:07:23,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 22:07:23,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:23,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 22:07:23,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:07:23,370 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 22 states. [2019-10-14 22:07:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:25,142 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-10-14 22:07:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 22:07:25,143 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-10-14 22:07:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:25,144 INFO L225 Difference]: With dead ends: 124 [2019-10-14 22:07:25,144 INFO L226 Difference]: Without dead ends: 94 [2019-10-14 22:07:25,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2019-10-14 22:07:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-14 22:07:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-10-14 22:07:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-14 22:07:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-10-14 22:07:25,154 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 40 [2019-10-14 22:07:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:25,154 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-10-14 22:07:25,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 22:07:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-10-14 22:07:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 22:07:25,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:25,155 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:25,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:25,359 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash -372709504, now seen corresponding path program 3 times [2019-10-14 22:07:25,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:25,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600753086] [2019-10-14 22:07:25,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:25,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:25,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:25,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600753086] [2019-10-14 22:07:25,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238677558] [2019-10-14 22:07:25,865 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:26,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:07:26,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:26,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 88 conjunts are in the unsatisfiable core [2019-10-14 22:07:26,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:26,133 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:07:26,133 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:07:26,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:26,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:26,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:26,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-14 22:07:26,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:26,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:26,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:26,369 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-14 22:07:26,370 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-14 22:07:26,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:26,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:26,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:26,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:26,399 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 41 [2019-10-14 22:07:26,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:26,478 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-14 22:07:26,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:26,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:26,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:26,498 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-10-14 22:07:26,498 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:26,561 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-14 22:07:26,562 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-10-14 22:07:26,562 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-14 22:07:26,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:26,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:07:26,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:27,182 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-10-14 22:07:27,183 INFO L567 ElimStorePlain]: treesize reduction 40, result has 92.1 percent of original size [2019-10-14 22:07:27,184 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_51|], 11=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_46|]} [2019-10-14 22:07:27,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-14 22:07:27,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:27,444 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-14 22:07:27,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,452 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 279 [2019-10-14 22:07:27,454 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.