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/heap-data/min_max.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:03:03,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:03:03,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:03:03,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:03:03,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:03:03,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:03:03,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:03:03,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:03:03,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:03:03,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:03:03,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:03:03,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:03:03,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:03:03,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:03:03,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:03:03,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:03:03,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:03:03,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:03:03,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:03:03,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:03:03,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:03:03,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:03:03,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:03:03,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:03:03,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:03:03,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:03:03,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:03:03,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:03:03,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:03:03,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:03:03,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:03:03,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:03:03,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:03:03,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:03:03,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:03:03,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:03:03,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:03:03,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:03:03,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:03:03,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:03:03,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:03:03,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:03:03,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:03:03,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:03:03,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:03:03,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:03:03,283 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:03:03,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:03:03,284 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:03:03,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:03:03,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:03:03,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:03:03,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:03:03,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:03:03,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:03:03,285 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:03:03,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:03:03,285 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:03:03,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:03:03,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:03:03,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:03:03,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:03:03,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:03:03,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:03:03,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:03:03,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:03:03,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:03:03,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:03:03,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:03:03,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:03:03,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:03:03,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:03:03,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:03:03,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:03:03,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:03:03,337 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:03:03,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max.i [2019-09-20 13:03:03,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468c869af/591fd286f6494cd6bf622372c1727619/FLAG2fd6035ad [2019-09-20 13:03:03,959 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:03:03,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max.i [2019-09-20 13:03:03,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468c869af/591fd286f6494cd6bf622372c1727619/FLAG2fd6035ad [2019-09-20 13:03:04,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468c869af/591fd286f6494cd6bf622372c1727619 [2019-09-20 13:03:04,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:03:04,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:03:04,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:03:04,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:03:04,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:03:04,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac66c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04, skipping insertion in model container [2019-09-20 13:03:04,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,262 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:03:04,326 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:03:04,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:03:04,763 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:03:04,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:03:04,860 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:03:04,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04 WrapperNode [2019-09-20 13:03:04,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:03:04,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:03:04,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:03:04,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:03:04,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... [2019-09-20 13:03:04,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:03:04,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:03:04,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:03:04,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:03:04,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:03:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:03:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:03:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:03:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:03:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:03:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:03:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:03:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:03:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:03:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:03:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:03:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:03:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:03:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:03:05,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:03:05,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:03:05,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:03:05,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:03:05,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:03:05,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:03:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:03:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:03:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:03:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:03:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:03:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:03:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:03:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:03:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:03:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:03:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:03:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:03:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:03:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:03:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:03:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:03:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:03:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:03:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:03:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:03:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:03:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:03:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:03:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:03:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:03:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:03:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:03:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:03:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:03:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:03:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:03:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:03:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:03:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:03:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:03:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:03:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:03:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:03:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:03:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:03:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:03:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:03:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:03:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:03:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:03:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:03:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:03:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:03:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:03:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:03:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:03:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:03:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:03:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:03:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:03:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:03:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:03:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:03:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:03:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:03:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:03:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:03:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:03:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:03:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:03:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:03:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:03:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:03:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:03:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:03:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:03:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:03:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:03:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:03:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:03:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:03:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:03:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:03:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:03:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:03:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:03:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:03:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:03:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:03:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:03:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:03:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:03:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:03:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:03:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:03:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:03:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:03:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:03:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:03:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:03:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:03:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:03:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:03:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:03:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:03:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:03:05,554 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:03:05,555 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 13:03:05,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:03:05 BoogieIcfgContainer [2019-09-20 13:03:05,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:03:05,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:03:05,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:03:05,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:03:05,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:03:04" (1/3) ... [2019-09-20 13:03:05,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21585202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:03:05, skipping insertion in model container [2019-09-20 13:03:05,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:04" (2/3) ... [2019-09-20 13:03:05,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21585202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:03:05, skipping insertion in model container [2019-09-20 13:03:05,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:03:05" (3/3) ... [2019-09-20 13:03:05,565 INFO L109 eAbstractionObserver]: Analyzing ICFG min_max.i [2019-09-20 13:03:05,576 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:03:05,584 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-20 13:03:05,603 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-20 13:03:05,636 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:03:05,637 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:03:05,637 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:03:05,638 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:03:05,640 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:03:05,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:03:05,641 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:03:05,649 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:03:05,649 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:03:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-20 13:03:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-20 13:03:05,679 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:05,680 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:05,682 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1192142104, now seen corresponding path program 1 times [2019-09-20 13:03:05,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:05,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:05,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:05,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:03:05,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:03:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:03:05,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:03:05,860 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-20 13:03:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:05,885 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-20 13:03:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:03:05,887 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-09-20 13:03:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:05,899 INFO L225 Difference]: With dead ends: 39 [2019-09-20 13:03:05,900 INFO L226 Difference]: Without dead ends: 21 [2019-09-20 13:03:05,904 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:03:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-20 13:03:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-20 13:03:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-20 13:03:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-09-20 13:03:05,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2019-09-20 13:03:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:05,949 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-09-20 13:03:05,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:03:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-09-20 13:03:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:03:05,951 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:05,951 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:05,952 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1107899532, now seen corresponding path program 1 times [2019-09-20 13:03:05,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:05,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:05,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:05,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:06,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:03:06,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:03:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:03:06,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:03:06,111 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2019-09-20 13:03:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:06,176 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-20 13:03:06,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:03:06,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 13:03:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:06,178 INFO L225 Difference]: With dead ends: 34 [2019-09-20 13:03:06,178 INFO L226 Difference]: Without dead ends: 23 [2019-09-20 13:03:06,179 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:03:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-20 13:03:06,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-20 13:03:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 13:03:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-20 13:03:06,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2019-09-20 13:03:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:06,186 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-20 13:03:06,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:03:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-20 13:03:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:03:06,187 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:06,188 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:06,188 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash 897845277, now seen corresponding path program 1 times [2019-09-20 13:03:06,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:06,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:06,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:06,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:06,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:06,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:03:06,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:03:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:03:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:03:06,404 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-09-20 13:03:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:06,600 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-20 13:03:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:03:06,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-20 13:03:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:06,603 INFO L225 Difference]: With dead ends: 32 [2019-09-20 13:03:06,603 INFO L226 Difference]: Without dead ends: 30 [2019-09-20 13:03:06,604 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:03:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-20 13:03:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-20 13:03:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 13:03:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-20 13:03:06,616 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-09-20 13:03:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:06,616 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-20 13:03:06,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:03:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-20 13:03:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:03:06,617 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:06,618 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:06,619 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash -458989665, now seen corresponding path program 1 times [2019-09-20 13:03:06,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:06,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:06,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:06,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:06,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:03:06,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:03:06,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:03:06,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:03:06,867 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-09-20 13:03:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:07,085 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-20 13:03:07,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:03:07,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-09-20 13:03:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:07,088 INFO L225 Difference]: With dead ends: 44 [2019-09-20 13:03:07,088 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:03:07,090 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:03:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:03:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-09-20 13:03:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 13:03:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-20 13:03:07,102 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-09-20 13:03:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:07,103 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-20 13:03:07,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:03:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-20 13:03:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:03:07,107 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:07,107 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:07,107 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:07,108 INFO L82 PathProgramCache]: Analyzing trace with hash 221068705, now seen corresponding path program 1 times [2019-09-20 13:03:07,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:07,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:07,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:07,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:03:07,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:03:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:03:07,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:03:07,377 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-09-20 13:03:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:07,574 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-20 13:03:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:03:07,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-20 13:03:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:07,576 INFO L225 Difference]: With dead ends: 37 [2019-09-20 13:03:07,576 INFO L226 Difference]: Without dead ends: 35 [2019-09-20 13:03:07,577 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:03:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-20 13:03:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-09-20 13:03:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 13:03:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-20 13:03:07,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-09-20 13:03:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:07,583 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-20 13:03:07,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:03:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-20 13:03:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:03:07,584 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:07,584 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:07,585 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:07,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1418643305, now seen corresponding path program 1 times [2019-09-20 13:03:07,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:07,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:07,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:07,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:07,691 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:07,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:07,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 13:03:07,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:07,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:07,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:07,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:07,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:07,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:07,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:07,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:07,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-09-20 13:03:07,957 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-09-20 13:03:07,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:07,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:07,974 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-09-20 13:03:07,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:07,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:07,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:07,981 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-09-20 13:03:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-20 13:03:07,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:07,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-09-20 13:03:07,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:03:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:03:07,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:03:07,990 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-09-20 13:03:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:08,127 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-09-20 13:03:08,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:03:08,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-20 13:03:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:08,128 INFO L225 Difference]: With dead ends: 48 [2019-09-20 13:03:08,128 INFO L226 Difference]: Without dead ends: 32 [2019-09-20 13:03:08,129 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:03:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-20 13:03:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-20 13:03:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 13:03:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-20 13:03:08,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2019-09-20 13:03:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:08,139 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-20 13:03:08,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:03:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-20 13:03:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:03:08,142 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:08,142 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:08,142 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:08,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1939400262, now seen corresponding path program 2 times [2019-09-20 13:03:08,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:08,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:08,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:03:08,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:08,281 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:08,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:03:08,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:03:08,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:08,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 13:03:08,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:08,395 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 19 treesize of output 7 [2019-09-20 13:03:08,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:08,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:08,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:08,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-20 13:03:08,432 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 21 treesize of output 9 [2019-09-20 13:03:08,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:08,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:08,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:08,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-09-20 13:03:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:03:08,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:08,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-09-20 13:03:08,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:03:08,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:03:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:03:08,444 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 9 states. [2019-09-20 13:03:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:08,651 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-09-20 13:03:08,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:03:08,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-09-20 13:03:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:08,657 INFO L225 Difference]: With dead ends: 90 [2019-09-20 13:03:08,657 INFO L226 Difference]: Without dead ends: 71 [2019-09-20 13:03:08,657 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:03:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-20 13:03:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-09-20 13:03:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-20 13:03:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-20 13:03:08,665 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-20 13:03:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:08,665 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-20 13:03:08,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:03:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-20 13:03:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:03:08,666 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:08,666 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:08,667 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1681234824, now seen corresponding path program 1 times [2019-09-20 13:03:08,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:08,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:03:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:08,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:08,881 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:08,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:09,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-20 13:03:09,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:09,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:09,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:09,086 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:09,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,114 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_9|, |v_#memory_$Pointer$.base_9|], 4=[|v_#memory_int_11|]} [2019-09-20 13:03:09,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:09,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:09,150 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:09,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:09,198 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,220 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-09-20 13:03:09,338 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 35 treesize of output 23 [2019-09-20 13:03:09,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:09,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:09,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-09-20 13:03:09,407 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 32 treesize of output 12 [2019-09-20 13:03:09,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:09,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:09,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-20 13:03:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:09,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:09,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-09-20 13:03:09,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 13:03:09,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 13:03:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:03:09,427 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 16 states. [2019-09-20 13:03:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:10,101 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-20 13:03:10,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:03:10,102 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-09-20 13:03:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:10,103 INFO L225 Difference]: With dead ends: 71 [2019-09-20 13:03:10,103 INFO L226 Difference]: Without dead ends: 69 [2019-09-20 13:03:10,104 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:03:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-20 13:03:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-09-20 13:03:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 13:03:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-09-20 13:03:10,113 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 27 [2019-09-20 13:03:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:10,113 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-09-20 13:03:10,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 13:03:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-09-20 13:03:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:03:10,115 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:10,115 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:10,116 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1344449784, now seen corresponding path program 1 times [2019-09-20 13:03:10,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:10,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:10,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:10,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:10,345 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:10,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:10,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-20 13:03:10,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:10,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:10,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:10,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:10,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,539 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|, |v_#memory_$Pointer$.base_10|], 4=[|v_#memory_int_12|]} [2019-09-20 13:03:10,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:10,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:10,570 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:10,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:10,591 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,604 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-20 13:03:10,656 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 27 treesize of output 15 [2019-09-20 13:03:10,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:10,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-20 13:03:10,692 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-09-20 13:03:10,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:03:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:10,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:10,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-09-20 13:03:10,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:03:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:03:10,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:03:10,711 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 14 states. [2019-09-20 13:03:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:11,361 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-20 13:03:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:03:11,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-09-20 13:03:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:11,363 INFO L225 Difference]: With dead ends: 65 [2019-09-20 13:03:11,364 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 13:03:11,365 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:03:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 13:03:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-09-20 13:03:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 13:03:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-20 13:03:11,372 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2019-09-20 13:03:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:11,372 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-20 13:03:11,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:03:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-20 13:03:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:03:11,373 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:11,373 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:11,374 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:11,374 INFO L82 PathProgramCache]: Analyzing trace with hash -758836934, now seen corresponding path program 1 times [2019-09-20 13:03:11,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:11,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:11,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:11,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:11,694 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:11,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-20 13:03:11,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:11,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:11,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:11,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:11,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,894 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_11|, |v_#memory_$Pointer$.base_11|], 4=[|v_#memory_int_13|]} [2019-09-20 13:03:11,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:11,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:11,920 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:11,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:11,940 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,951 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-20 13:03:12,018 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 27 treesize of output 15 [2019-09-20 13:03:12,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:12,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:12,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:12,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:12,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:12,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:12,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-20 13:03:12,064 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-09-20 13:03:12,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:12,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:12,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:12,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:03:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:03:12,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:12,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-09-20 13:03:12,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:03:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:03:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:03:12,078 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2019-09-20 13:03:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:12,841 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2019-09-20 13:03:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:03:12,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-09-20 13:03:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:12,843 INFO L225 Difference]: With dead ends: 92 [2019-09-20 13:03:12,844 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:03:12,844 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:03:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:03:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2019-09-20 13:03:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-20 13:03:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-09-20 13:03:12,854 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 29 [2019-09-20 13:03:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:12,855 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-09-20 13:03:12,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:03:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-09-20 13:03:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:03:12,856 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:12,856 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:12,856 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash -768788038, now seen corresponding path program 1 times [2019-09-20 13:03:12,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:12,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:12,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:12,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:13,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:13,126 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:13,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:13,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-20 13:03:13,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:13,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:13,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:13,273 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:13,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,298 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 4=[|v_#memory_int_14|]} [2019-09-20 13:03:13,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:13,317 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:13,346 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:13,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:13,377 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,393 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:33 [2019-09-20 13:03:13,541 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 35 treesize of output 23 [2019-09-20 13:03:13,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:13,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:13,572 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-09-20 13:03:13,620 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 32 treesize of output 12 [2019-09-20 13:03:13,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-20 13:03:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:13,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:13,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-09-20 13:03:13,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 13:03:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 13:03:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:03:13,640 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 18 states. [2019-09-20 13:03:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:14,565 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2019-09-20 13:03:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:03:14,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-09-20 13:03:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:14,568 INFO L225 Difference]: With dead ends: 113 [2019-09-20 13:03:14,568 INFO L226 Difference]: Without dead ends: 111 [2019-09-20 13:03:14,569 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-09-20 13:03:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-20 13:03:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-09-20 13:03:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 13:03:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-20 13:03:14,579 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-09-20 13:03:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:14,579 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-20 13:03:14,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 13:03:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-20 13:03:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:03:14,580 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:14,580 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:14,581 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1436663426, now seen corresponding path program 2 times [2019-09-20 13:03:14,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:14,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:14,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:14,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:14,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:03:14,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:14,683 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:14,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:03:14,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:03:14,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:14,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 13:03:14,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:14,784 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 19 treesize of output 7 [2019-09-20 13:03:14,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:14,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:14,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:14,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-20 13:03:14,804 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 21 treesize of output 9 [2019-09-20 13:03:14,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:14,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:14,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:14,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-09-20 13:03:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:03:14,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:14,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-09-20 13:03:14,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:03:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:03:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:03:14,822 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 10 states. [2019-09-20 13:03:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:15,056 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2019-09-20 13:03:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:03:15,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-20 13:03:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:15,059 INFO L225 Difference]: With dead ends: 145 [2019-09-20 13:03:15,059 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:03:15,060 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:03:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:03:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2019-09-20 13:03:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 13:03:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-09-20 13:03:15,070 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 29 [2019-09-20 13:03:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:15,070 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-09-20 13:03:15,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:03:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-09-20 13:03:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:03:15,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:15,071 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:15,072 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1847186620, now seen corresponding path program 1 times [2019-09-20 13:03:15,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:15,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:15,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:03:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:15,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:15,311 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:15,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-20 13:03:15,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:15,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:15,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:15,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:15,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,507 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_13|, |v_#memory_$Pointer$.offset_13|], 4=[|v_#memory_int_15|]} [2019-09-20 13:03:15,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:15,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:15,539 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:15,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:15,567 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,582 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-20 13:03:15,646 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 27 treesize of output 15 [2019-09-20 13:03:15,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:15,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-20 13:03:15,694 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-09-20 13:03:15,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:15,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:15,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:03:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:15,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:15,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-09-20 13:03:15,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:03:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:03:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:03:15,710 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 15 states. [2019-09-20 13:03:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:16,835 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-09-20 13:03:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:03:16,836 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-09-20 13:03:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:16,837 INFO L225 Difference]: With dead ends: 92 [2019-09-20 13:03:16,837 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:03:16,838 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-09-20 13:03:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:03:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2019-09-20 13:03:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-20 13:03:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-09-20 13:03:16,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 29 [2019-09-20 13:03:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:16,860 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-09-20 13:03:16,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:03:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-09-20 13:03:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:03:16,861 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:16,861 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:16,861 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:16,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1837235516, now seen corresponding path program 1 times [2019-09-20 13:03:16,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:16,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:16,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:17,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:17,177 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:17,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:17,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-20 13:03:17,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:17,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:17,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:17,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:17,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,396 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_14|], 4=[|v_#memory_int_16|]} [2019-09-20 13:03:17,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:17,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:17,441 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:17,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:17,478 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,500 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-09-20 13:03:17,651 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 33 treesize of output 21 [2019-09-20 13:03:17,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:17,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:17,686 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:30 [2019-09-20 13:03:17,726 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 30 treesize of output 10 [2019-09-20 13:03:17,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-09-20 13:03:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:17,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:17,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-09-20 13:03:17,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:03:17,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:03:17,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:03:17,766 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 21 states. [2019-09-20 13:03:19,535 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-20 13:03:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:20,406 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-09-20 13:03:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-20 13:03:20,407 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-09-20 13:03:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:20,409 INFO L225 Difference]: With dead ends: 135 [2019-09-20 13:03:20,409 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 13:03:20,411 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=327, Invalid=1835, Unknown=0, NotChecked=0, Total=2162 [2019-09-20 13:03:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 13:03:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 39. [2019-09-20 13:03:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-20 13:03:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-20 13:03:20,417 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2019-09-20 13:03:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:20,417 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-20 13:03:20,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:03:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-20 13:03:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:03:20,418 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:20,418 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:20,419 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:20,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2094339090, now seen corresponding path program 2 times [2019-09-20 13:03:20,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:20,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:20,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:20,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:20,564 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:03:20,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:03:20,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:20,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-20 13:03:20,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:20,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:20,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:20,719 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:20,731 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,740 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-09-20 13:03:20,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:20,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:03:20,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-20 13:03:20,833 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:03:20,859 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-20 13:03:20,875 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,885 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-09-20 13:03:21,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:21,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-09-20 13:03:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:21,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:21,007 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:21,023 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-09-20 13:03:21,031 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-09-20 13:03:21,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:21,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:21,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:21,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-09-20 13:03:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:03:21,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:21,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-09-20 13:03:21,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:03:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:03:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:03:21,058 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2019-09-20 13:03:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:21,451 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-20 13:03:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:03:21,451 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-20 13:03:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:21,452 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:03:21,452 INFO L226 Difference]: Without dead ends: 46 [2019-09-20 13:03:21,453 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:03:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-20 13:03:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-20 13:03:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:03:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-09-20 13:03:21,458 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 32 [2019-09-20 13:03:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:21,459 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-09-20 13:03:21,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:03:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-09-20 13:03:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 13:03:21,460 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:21,460 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:21,460 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 934068797, now seen corresponding path program 3 times [2019-09-20 13:03:21,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:21,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:21,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:03:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:21,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:21,802 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:21,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:03:21,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:03:21,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:21,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-20 13:03:21,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:21,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:21,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:21,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:21,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:21,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:22,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:03:22,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,077 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-09-20 13:03:22,078 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|], 4=[|v_#memory_int_17|]} [2019-09-20 13:03:22,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:22,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:22,113 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:22,140 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,157 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-09-20 13:03:22,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-20 13:03:22,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,293 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 4=[|v_#memory_int_18|]} [2019-09-20 13:03:22,299 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:22,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,344 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:22,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-09-20 13:03:22,386 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,452 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-09-20 13:03:22,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,460 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 24 treesize of output 27 [2019-09-20 13:03:22,461 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-09-20 13:03:22,501 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,530 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:71 [2019-09-20 13:03:22,947 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-20 13:03:22,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 55 [2019-09-20 13:03:22,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:22,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:22,951 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:22,989 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-09-20 13:03:22,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,998 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-09-20 13:03:22,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:23,011 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-09-20 13:03:23,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2019-09-20 13:03:23,061 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 26 treesize of output 10 [2019-09-20 13:03:23,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:23,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-20 13:03:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:23,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:23,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-09-20 13:03:23,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-20 13:03:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-20 13:03:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-09-20 13:03:23,110 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 26 states. [2019-09-20 13:03:24,769 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-20 13:03:25,571 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-20 13:03:25,752 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-20 13:03:25,969 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-20 13:03:26,326 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-20 13:03:26,525 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-20 13:03:26,754 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-20 13:03:27,173 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-20 13:03:27,909 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-20 13:03:28,197 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-20 13:03:28,514 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-20 13:03:28,853 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-20 13:03:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:29,260 INFO L93 Difference]: Finished difference Result 279 states and 305 transitions. [2019-09-20 13:03:29,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-20 13:03:29,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-09-20 13:03:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:29,262 INFO L225 Difference]: With dead ends: 279 [2019-09-20 13:03:29,262 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:03:29,263 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=566, Invalid=3340, Unknown=0, NotChecked=0, Total=3906 [2019-09-20 13:03:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:03:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 93. [2019-09-20 13:03:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-20 13:03:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-09-20 13:03:29,276 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 37 [2019-09-20 13:03:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:29,276 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-09-20 13:03:29,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-20 13:03:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2019-09-20 13:03:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 13:03:29,278 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:29,278 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:29,278 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash 833472957, now seen corresponding path program 1 times [2019-09-20 13:03:29,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:29,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:29,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:03:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:29,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:29,570 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:29,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:29,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-20 13:03:29,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:29,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:29,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:29,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:03:29,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,794 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 4=[|v_#memory_int_19|]} [2019-09-20 13:03:29,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:29,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:29,842 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:29,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-09-20 13:03:29,876 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:29,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:29,900 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:56 [2019-09-20 13:03:30,000 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_22|], 9=[|v_#memory_int_20|]} [2019-09-20 13:03:30,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:30,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-09-20 13:03:30,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:30,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:30,066 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:30,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:30,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:30,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:30,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 43 [2019-09-20 13:03:30,120 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:30,194 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.1 percent of original size [2019-09-20 13:03:30,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:30,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 51 [2019-09-20 13:03:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,213 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:30,289 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.1 percent of original size [2019-09-20 13:03:30,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:30,298 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:30,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:30,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 75 [2019-09-20 13:03:30,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,331 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:30,462 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-20 13:03:30,462 INFO L567 ElimStorePlain]: treesize reduction 34, result has 79.6 percent of original size [2019-09-20 13:03:30,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:30,466 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:132, output treesize:143 [2019-09-20 13:03:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:30,822 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-20 13:03:30,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:30,995 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-20 13:03:31,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 62 [2019-09-20 13:03:31,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:31,294 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:31,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 63 [2019-09-20 13:03:31,300 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:31,319 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-20 13:03:31,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 76 [2019-09-20 13:03:31,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,322 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:31,434 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-20 13:03:31,435 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.7 percent of original size [2019-09-20 13:03:31,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:31,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,460 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 1 case distinctions, treesize of input 59 treesize of output 54 [2019-09-20 13:03:31,461 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:31,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:31,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,478 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 1 case distinctions, treesize of input 49 treesize of output 44 [2019-09-20 13:03:31,478 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:31,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2019-09-20 13:03:31,488 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:31,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-09-20 13:03:31,522 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:270, output treesize:88 [2019-09-20 13:03:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:03:31,623 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_4, |#memory_int|], 3=[v_prenex_6]} [2019-09-20 13:03:31,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,632 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 28 treesize of output 20 [2019-09-20 13:03:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:31,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,671 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 30 treesize of output 22 [2019-09-20 13:03:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:31,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,708 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 41 [2019-09-20 13:03:31,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:31,712 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:31,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:31,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-20 13:03:31,731 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:100, output treesize:11 [2019-09-20 13:03:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:31,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:31,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-09-20 13:03:31,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-20 13:03:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-20 13:03:31,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-09-20 13:03:31,790 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 25 states. [2019-09-20 13:03:33,189 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-09-20 13:03:33,420 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-20 13:03:33,680 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-20 13:03:34,119 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-09-20 13:03:34,549 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2019-09-20 13:03:35,671 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-09-20 13:03:36,279 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-09-20 13:03:36,663 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 153 [2019-09-20 13:03:37,709 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-20 13:03:38,112 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 155 [2019-09-20 13:03:38,876 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-20 13:03:39,181 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 99 [2019-09-20 13:03:39,427 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-20 13:03:40,019 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-20 13:03:40,307 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 101 [2019-09-20 13:03:41,183 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-20 13:03:41,402 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-20 13:03:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:41,772 INFO L93 Difference]: Finished difference Result 453 states and 500 transitions. [2019-09-20 13:03:41,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-20 13:03:41,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-09-20 13:03:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:41,776 INFO L225 Difference]: With dead ends: 453 [2019-09-20 13:03:41,776 INFO L226 Difference]: Without dead ends: 451 [2019-09-20 13:03:41,778 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1163, Invalid=6147, Unknown=0, NotChecked=0, Total=7310 [2019-09-20 13:03:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-20 13:03:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 120. [2019-09-20 13:03:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-20 13:03:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2019-09-20 13:03:41,797 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 37 [2019-09-20 13:03:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:41,797 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2019-09-20 13:03:41,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-20 13:03:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2019-09-20 13:03:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 13:03:41,798 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:41,798 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:41,798 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash 581200573, now seen corresponding path program 2 times [2019-09-20 13:03:41,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:41,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:41,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:42,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:42,088 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:42,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:03:42,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:03:42,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:42,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-20 13:03:42,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:42,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:42,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:42,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:03:42,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,341 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-09-20 13:03:42,347 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|], 4=[|v_#memory_int_21|]} [2019-09-20 13:03:42,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:42,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:42,375 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:42,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:42,406 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,420 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-09-20 13:03:42,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-20 13:03:42,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,533 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_25|], 4=[|v_#memory_int_22|]} [2019-09-20 13:03:42,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2019-09-20 13:03:42,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-09-20 13:03:42,594 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:03:42,653 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-20 13:03:42,695 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:42,735 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 32 treesize of output 24 [2019-09-20 13:03:42,735 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,768 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:144, output treesize:97 [2019-09-20 13:03:43,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:43,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 66 [2019-09-20 13:03:43,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:43,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:43,093 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:43,125 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2019-09-20 13:03:43,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-09-20 13:03:43,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:43,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:43,141 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-09-20 13:03:43,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:24 [2019-09-20 13:03:43,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:43,189 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 28 treesize of output 20 [2019-09-20 13:03:43,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:43,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:43,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:43,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:43,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-09-20 13:03:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:43,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:43,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-09-20 13:03:43,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-20 13:03:43,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-20 13:03:43,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:03:43,267 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand 22 states. [2019-09-20 13:03:44,087 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-20 13:03:44,261 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-09-20 13:03:44,763 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-20 13:03:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:44,829 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2019-09-20 13:03:44,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:03:44,829 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-09-20 13:03:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:44,830 INFO L225 Difference]: With dead ends: 164 [2019-09-20 13:03:44,830 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:03:44,831 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-09-20 13:03:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:03:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2019-09-20 13:03:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-20 13:03:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2019-09-20 13:03:44,846 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 37 [2019-09-20 13:03:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:44,846 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2019-09-20 13:03:44,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-20 13:03:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2019-09-20 13:03:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 13:03:44,847 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:44,848 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:44,848 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:44,848 INFO L82 PathProgramCache]: Analyzing trace with hash 480604733, now seen corresponding path program 2 times [2019-09-20 13:03:44,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:44,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:44,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:44,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:03:44,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:45,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:45,124 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:45,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:03:45,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:03:45,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:45,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-20 13:03:45,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:45,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:45,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:45,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:45,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:45,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:45,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:45,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:03:45,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:45,480 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-09-20 13:03:45,482 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_int_23|]} [2019-09-20 13:03:45,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:45,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:45,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:45,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:45,533 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:45,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:45,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:45,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-09-20 13:03:45,576 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:45,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:45,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:45,609 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:79, output treesize:58