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/array-examples/relax-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 09:16:06,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 09:16:06,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 09:16:06,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 09:16:06,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 09:16:06,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 09:16:06,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 09:16:06,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 09:16:06,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 09:16:06,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 09:16:06,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 09:16:06,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 09:16:06,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 09:16:06,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 09:16:06,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 09:16:06,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 09:16:06,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 09:16:06,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 09:16:06,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 09:16:06,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 09:16:06,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 09:16:06,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 09:16:06,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 09:16:06,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 09:16:06,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 09:16:06,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 09:16:06,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 09:16:06,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 09:16:06,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 09:16:06,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 09:16:06,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 09:16:06,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 09:16:06,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 09:16:06,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 09:16:06,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 09:16:06,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 09:16:06,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 09:16:06,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 09:16:06,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 09:16:06,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 09:16:06,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 09:16:06,463 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-07 09:16:06,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 09:16:06,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 09:16:06,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 09:16:06,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 09:16:06,482 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 09:16:06,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 09:16:06,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 09:16:06,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 09:16:06,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 09:16:06,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 09:16:06,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 09:16:06,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 09:16:06,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 09:16:06,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 09:16:06,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 09:16:06,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 09:16:06,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 09:16:06,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 09:16:06,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 09:16:06,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 09:16:06,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 09:16:06,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:16:06,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 09:16:06,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 09:16:06,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 09:16:06,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 09:16:06,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 09:16:06,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 09:16:06,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 09:16:06,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 09:16:06,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 09:16:06,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 09:16:06,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 09:16:06,555 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 09:16:06,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax-2.i [2019-09-07 09:16:06,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940bac67a/1b0611798ca04ca68e7ad075146e53ab/FLAG5fba8256e [2019-09-07 09:16:07,197 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 09:16:07,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2.i [2019-09-07 09:16:07,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940bac67a/1b0611798ca04ca68e7ad075146e53ab/FLAG5fba8256e [2019-09-07 09:16:07,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940bac67a/1b0611798ca04ca68e7ad075146e53ab [2019-09-07 09:16:07,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 09:16:07,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 09:16:07,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 09:16:07,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 09:16:07,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 09:16:07,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:16:07" (1/1) ... [2019-09-07 09:16:07,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47852f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:07, skipping insertion in model container [2019-09-07 09:16:07,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:16:07" (1/1) ... [2019-09-07 09:16:07,494 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 09:16:07,536 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 09:16:07,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:16:07,990 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 09:16:08,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:16:08,102 INFO L192 MainTranslator]: Completed translation [2019-09-07 09:16:08,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08 WrapperNode [2019-09-07 09:16:08,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 09:16:08,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 09:16:08,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 09:16:08,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 09:16:08,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (1/1) ... [2019-09-07 09:16:08,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (1/1) ... [2019-09-07 09:16:08,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (1/1) ... [2019-09-07 09:16:08,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (1/1) ... [2019-09-07 09:16:08,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (1/1) ... [2019-09-07 09:16:08,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (1/1) ... [2019-09-07 09:16:08,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (1/1) ... [2019-09-07 09:16:08,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 09:16:08,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 09:16:08,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 09:16:08,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 09:16:08,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (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-07 09:16:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 09:16:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 09:16:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 09:16:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-07 09:16:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-07 09:16:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure is_relaxed_prefix [2019-09-07 09:16:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 09:16:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-07 09:16:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 09:16:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 09:16:08,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 09:16:08,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 09:16:08,237 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-07 09:16:08,237 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-07 09:16:08,237 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-07 09:16:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-07 09:16:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-07 09:16:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-07 09:16:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-07 09:16:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-07 09:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-07 09:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-07 09:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-07 09:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-07 09:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-07 09:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-07 09:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-07 09:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-07 09:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-07 09:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-07 09:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-07 09:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-07 09:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-07 09:16:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-07 09:16:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-07 09:16:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-07 09:16:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-07 09:16:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-07 09:16:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-07 09:16:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-07 09:16:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-07 09:16:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-07 09:16:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-07 09:16:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-07 09:16:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-07 09:16:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-07 09:16:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-07 09:16:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-07 09:16:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-07 09:16:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-07 09:16:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-07 09:16:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-07 09:16:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-07 09:16:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-07 09:16:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-07 09:16:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-07 09:16:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-07 09:16:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-07 09:16:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-07 09:16:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-07 09:16:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-07 09:16:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-07 09:16:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-07 09:16:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-07 09:16:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 09:16:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-07 09:16:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-07 09:16:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-07 09:16:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-07 09:16:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-07 09:16:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-07 09:16:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-07 09:16:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-07 09:16:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-07 09:16:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-07 09:16:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 09:16:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-07 09:16:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-07 09:16:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-07 09:16:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-07 09:16:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-07 09:16:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-07 09:16:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-07 09:16:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-07 09:16:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-07 09:16:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-07 09:16:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-07 09:16:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-07 09:16:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-07 09:16:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-07 09:16:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-07 09:16:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-07 09:16:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-07 09:16:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-07 09:16:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-07 09:16:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-07 09:16:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-07 09:16:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-07 09:16:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-07 09:16:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-07 09:16:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-07 09:16:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-07 09:16:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-07 09:16:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-07 09:16:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-07 09:16:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-07 09:16:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-07 09:16:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-07 09:16:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-07 09:16:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-07 09:16:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-07 09:16:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-07 09:16:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-07 09:16:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-07 09:16:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure is_relaxed_prefix [2019-09-07 09:16:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 09:16:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 09:16:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 09:16:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 09:16:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 09:16:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 09:16:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 09:16:08,868 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 09:16:08,869 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-07 09:16:08,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:16:08 BoogieIcfgContainer [2019-09-07 09:16:08,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 09:16:08,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 09:16:08,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 09:16:08,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 09:16:08,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:16:07" (1/3) ... [2019-09-07 09:16:08,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe0c179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:16:08, skipping insertion in model container [2019-09-07 09:16:08,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:16:08" (2/3) ... [2019-09-07 09:16:08,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe0c179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:16:08, skipping insertion in model container [2019-09-07 09:16:08,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:16:08" (3/3) ... [2019-09-07 09:16:08,884 INFO L109 eAbstractionObserver]: Analyzing ICFG relax-2.i [2019-09-07 09:16:08,894 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 09:16:08,905 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 09:16:08,921 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 09:16:08,960 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 09:16:08,961 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 09:16:08,961 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 09:16:08,961 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 09:16:08,964 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 09:16:08,964 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 09:16:08,964 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 09:16:08,964 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 09:16:08,964 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 09:16:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-09-07 09:16:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 09:16:08,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:08,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:09,001 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1056215727, now seen corresponding path program 1 times [2019-09-07 09:16:09,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:09,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:09,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:09,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:09,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:09,257 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-07 09:16:09,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:16:09,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 09:16:09,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 09:16:09,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 09:16:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 09:16:09,290 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2019-09-07 09:16:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:09,363 INFO L93 Difference]: Finished difference Result 95 states and 146 transitions. [2019-09-07 09:16:09,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:16:09,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-07 09:16:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:09,379 INFO L225 Difference]: With dead ends: 95 [2019-09-07 09:16:09,380 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 09:16:09,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 09:16:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 09:16:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-07 09:16:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 09:16:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2019-09-07 09:16:09,451 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 19 [2019-09-07 09:16:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:09,452 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-09-07 09:16:09,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 09:16:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2019-09-07 09:16:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 09:16:09,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:09,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:09,455 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -864018085, now seen corresponding path program 1 times [2019-09-07 09:16:09,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:09,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:09,605 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-07 09:16:09,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:16:09,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 09:16:09,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:16:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:16:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:16:09,608 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand 6 states. [2019-09-07 09:16:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:09,778 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2019-09-07 09:16:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:16:09,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-07 09:16:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:09,781 INFO L225 Difference]: With dead ends: 88 [2019-09-07 09:16:09,781 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 09:16:09,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 09:16:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 09:16:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-09-07 09:16:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-07 09:16:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2019-09-07 09:16:09,794 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 21 [2019-09-07 09:16:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:09,794 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2019-09-07 09:16:09,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:16:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2019-09-07 09:16:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 09:16:09,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:09,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:09,796 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2053893332, now seen corresponding path program 1 times [2019-09-07 09:16:09,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:09,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:09,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:09,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:09,963 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-07 09:16:09,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:16:09,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 09:16:09,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:16:09,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:16:09,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:16:09,968 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand 6 states. [2019-09-07 09:16:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:10,165 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-09-07 09:16:10,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:16:10,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-07 09:16:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:10,169 INFO L225 Difference]: With dead ends: 74 [2019-09-07 09:16:10,169 INFO L226 Difference]: Without dead ends: 63 [2019-09-07 09:16:10,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 09:16:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-07 09:16:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-07 09:16:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 09:16:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-09-07 09:16:10,193 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 22 [2019-09-07 09:16:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:10,193 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-09-07 09:16:10,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:16:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-09-07 09:16:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 09:16:10,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:10,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:10,197 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1666437145, now seen corresponding path program 1 times [2019-09-07 09:16:10,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:10,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:10,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:16:10,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:10,528 INFO L223 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) [2019-09-07 09:16:10,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:10,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:16:10,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:10,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:10,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:16:10,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-07 09:16:10,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:16:10,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:16:10,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:16:10,777 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 14 states. [2019-09-07 09:16:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:11,848 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions. [2019-09-07 09:16:11,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 09:16:11,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-09-07 09:16:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:11,851 INFO L225 Difference]: With dead ends: 155 [2019-09-07 09:16:11,851 INFO L226 Difference]: Without dead ends: 140 [2019-09-07 09:16:11,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:16:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-07 09:16:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 74. [2019-09-07 09:16:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 09:16:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2019-09-07 09:16:11,867 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 23 [2019-09-07 09:16:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:11,868 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2019-09-07 09:16:11,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:16:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2019-09-07 09:16:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 09:16:11,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:11,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:11,870 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:11,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1672526710, now seen corresponding path program 1 times [2019-09-07 09:16:11,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:11,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:11,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:11,903 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-07 09:16:11,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:16:11,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 09:16:11,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 09:16:11,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 09:16:11,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 09:16:11,904 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 4 states. [2019-09-07 09:16:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:11,924 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2019-09-07 09:16:11,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:16:11,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-07 09:16:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:11,926 INFO L225 Difference]: With dead ends: 86 [2019-09-07 09:16:11,926 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 09:16:11,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 09:16:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 09:16:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-09-07 09:16:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 09:16:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-09-07 09:16:11,937 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 24 [2019-09-07 09:16:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:11,937 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-09-07 09:16:11,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 09:16:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-09-07 09:16:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 09:16:11,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:11,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:11,939 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash -351644855, now seen corresponding path program 1 times [2019-09-07 09:16:11,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:11,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:16:11,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:16:11,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:16:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:16:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:16:11,966 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 3 states. [2019-09-07 09:16:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:11,981 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2019-09-07 09:16:11,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:16:11,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 09:16:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:11,983 INFO L225 Difference]: With dead ends: 84 [2019-09-07 09:16:11,984 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 09:16:11,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:16:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 09:16:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-07 09:16:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 09:16:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2019-09-07 09:16:11,995 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 26 [2019-09-07 09:16:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:11,995 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2019-09-07 09:16:11,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:16:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2019-09-07 09:16:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 09:16:11,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:11,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:11,999 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:12,000 INFO L82 PathProgramCache]: Analyzing trace with hash -152989802, now seen corresponding path program 1 times [2019-09-07 09:16:12,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:12,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:16:12,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:12,112 INFO L223 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) [2019-09-07 09:16:12,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:12,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:16:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:16:12,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:12,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-09-07 09:16:12,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 09:16:12,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 09:16:12,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:16:12,265 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 9 states. [2019-09-07 09:16:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:12,500 INFO L93 Difference]: Finished difference Result 133 states and 180 transitions. [2019-09-07 09:16:12,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:16:12,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-07 09:16:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:12,502 INFO L225 Difference]: With dead ends: 133 [2019-09-07 09:16:12,502 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 09:16:12,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:16:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 09:16:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 83. [2019-09-07 09:16:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 09:16:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2019-09-07 09:16:12,517 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 26 [2019-09-07 09:16:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:12,517 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-09-07 09:16:12,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 09:16:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2019-09-07 09:16:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 09:16:12,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:12,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:12,520 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:12,521 INFO L82 PathProgramCache]: Analyzing trace with hash -151142760, now seen corresponding path program 1 times [2019-09-07 09:16:12,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:12,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:12,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:12,636 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-07 09:16:12,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:16:12,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 09:16:12,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 09:16:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 09:16:12,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:16:12,638 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 5 states. [2019-09-07 09:16:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:12,749 INFO L93 Difference]: Finished difference Result 111 states and 151 transitions. [2019-09-07 09:16:12,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 09:16:12,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-07 09:16:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:12,751 INFO L225 Difference]: With dead ends: 111 [2019-09-07 09:16:12,751 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 09:16:12,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:16:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 09:16:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2019-09-07 09:16:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 09:16:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-09-07 09:16:12,764 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 26 [2019-09-07 09:16:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:12,764 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-09-07 09:16:12,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 09:16:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-09-07 09:16:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 09:16:12,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:12,766 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:12,766 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1582442666, now seen corresponding path program 1 times [2019-09-07 09:16:12,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:12,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:12,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:12,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:12,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:16:12,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:12,942 INFO L223 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) [2019-09-07 09:16:12,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:12,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:16:12,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:16:13,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:16:13,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 09:16:13,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 09:16:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 09:16:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:16:13,070 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 10 states. [2019-09-07 09:16:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:13,521 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2019-09-07 09:16:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 09:16:13,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-07 09:16:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:13,523 INFO L225 Difference]: With dead ends: 167 [2019-09-07 09:16:13,523 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 09:16:13,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:16:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 09:16:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 81. [2019-09-07 09:16:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 09:16:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2019-09-07 09:16:13,542 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 26 [2019-09-07 09:16:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:13,542 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2019-09-07 09:16:13,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 09:16:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2019-09-07 09:16:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 09:16:13,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:13,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:13,544 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:13,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1141713006, now seen corresponding path program 1 times [2019-09-07 09:16:13,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:13,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:13,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:13,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:13,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:16:13,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:13,753 INFO L223 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) [2019-09-07 09:16:13,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:13,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 09:16:13,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:13,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:13,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2019-09-07 09:16:13,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:16:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:16:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:16:13,869 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 13 states. [2019-09-07 09:16:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:14,256 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2019-09-07 09:16:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 09:16:14,257 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-07 09:16:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:14,258 INFO L225 Difference]: With dead ends: 145 [2019-09-07 09:16:14,258 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 09:16:14,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:16:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 09:16:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2019-09-07 09:16:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 09:16:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-09-07 09:16:14,270 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 30 [2019-09-07 09:16:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:14,270 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-09-07 09:16:14,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:16:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-09-07 09:16:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 09:16:14,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:14,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:14,272 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash -455583279, now seen corresponding path program 1 times [2019-09-07 09:16:14,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:14,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:14,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 09:16:14,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:14,666 INFO L223 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-07 09:16:14,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:14,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:16:14,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:16:14,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:16:14,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-07 09:16:14,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:16:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:16:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:16:14,780 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 14 states. [2019-09-07 09:16:15,247 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-07 09:16:15,518 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-09-07 09:16:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:15,718 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2019-09-07 09:16:15,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:16:15,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-09-07 09:16:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:15,720 INFO L225 Difference]: With dead ends: 128 [2019-09-07 09:16:15,720 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 09:16:15,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:16:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 09:16:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2019-09-07 09:16:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 09:16:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2019-09-07 09:16:15,740 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 35 [2019-09-07 09:16:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:15,740 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2019-09-07 09:16:15,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:16:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2019-09-07 09:16:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 09:16:15,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:15,741 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:15,742 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash -150105135, now seen corresponding path program 1 times [2019-09-07 09:16:15,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:15,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:15,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:15,826 INFO L223 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) [2019-09-07 09:16:15,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:15,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:16:15,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 09:16:16,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:16:16,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-07 09:16:16,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 09:16:16,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 09:16:16,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:16:16,006 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand 12 states. [2019-09-07 09:16:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:16,563 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2019-09-07 09:16:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:16:16,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-09-07 09:16:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:16,569 INFO L225 Difference]: With dead ends: 137 [2019-09-07 09:16:16,569 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 09:16:16,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:16:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 09:16:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2019-09-07 09:16:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 09:16:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2019-09-07 09:16:16,591 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 37 [2019-09-07 09:16:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:16,591 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-09-07 09:16:16,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 09:16:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2019-09-07 09:16:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 09:16:16,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:16,592 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:16,593 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1358677729, now seen corresponding path program 1 times [2019-09-07 09:16:16,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:16,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:16,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 09:16:16,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:16,763 INFO L223 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) [2019-09-07 09:16:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:16,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:16:16,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:16,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:16,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-07 09:16:16,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:16:16,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:16:16,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:16:16,945 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand 17 states. [2019-09-07 09:16:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:17,557 INFO L93 Difference]: Finished difference Result 179 states and 239 transitions. [2019-09-07 09:16:17,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 09:16:17,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-07 09:16:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:17,559 INFO L225 Difference]: With dead ends: 179 [2019-09-07 09:16:17,559 INFO L226 Difference]: Without dead ends: 123 [2019-09-07 09:16:17,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:16:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-07 09:16:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2019-09-07 09:16:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-07 09:16:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2019-09-07 09:16:17,587 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 36 [2019-09-07 09:16:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:17,587 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-09-07 09:16:17,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:16:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2019-09-07 09:16:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 09:16:17,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:17,588 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:17,588 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1633694989, now seen corresponding path program 1 times [2019-09-07 09:16:17,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:17,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:17,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 09:16:17,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:17,666 INFO L223 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) [2019-09-07 09:16:17,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:17,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:16:17,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:17,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2019-09-07 09:16:17,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:16:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:16:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:16:17,882 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 17 states. [2019-09-07 09:16:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:18,416 INFO L93 Difference]: Finished difference Result 209 states and 295 transitions. [2019-09-07 09:16:18,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:16:18,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2019-09-07 09:16:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:18,419 INFO L225 Difference]: With dead ends: 209 [2019-09-07 09:16:18,419 INFO L226 Difference]: Without dead ends: 193 [2019-09-07 09:16:18,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:16:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-07 09:16:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 112. [2019-09-07 09:16:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 09:16:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2019-09-07 09:16:18,435 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 37 [2019-09-07 09:16:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:18,436 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2019-09-07 09:16:18,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:16:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2019-09-07 09:16:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 09:16:18,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:18,437 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:18,437 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash 824348363, now seen corresponding path program 1 times [2019-09-07 09:16:18,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:18,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:18,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:16:18,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:18,882 INFO L223 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) [2019-09-07 09:16:18,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:18,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 09:16:18,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:19,020 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 15 treesize of output 11 [2019-09-07 09:16:19,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:19,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:19,029 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-07 09:16:19,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-07 09:16:19,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:19,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:16:19,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:16:19,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:19,292 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 41 [2019-09-07 09:16:19,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:19,297 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:16:19,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:19,317 INFO L567 ElimStorePlain]: treesize reduction 11, result has 68.6 percent of original size [2019-09-07 09:16:19,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-07 09:16:19,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:93, output treesize:24 [2019-09-07 09:16:21,301 WARN L188 SmtUtils]: Spent 867.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 09:16:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:21,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:21,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 09:16:21,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 09:16:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 09:16:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=446, Unknown=1, NotChecked=0, Total=506 [2019-09-07 09:16:21,311 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand 23 states. [2019-09-07 09:16:22,883 WARN L188 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 09:16:25,150 WARN L188 SmtUtils]: Spent 919.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 09:16:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:25,235 INFO L93 Difference]: Finished difference Result 256 states and 352 transitions. [2019-09-07 09:16:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:16:25,236 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2019-09-07 09:16:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:25,238 INFO L225 Difference]: With dead ends: 256 [2019-09-07 09:16:25,238 INFO L226 Difference]: Without dead ends: 219 [2019-09-07 09:16:25,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=150, Invalid=1038, Unknown=2, NotChecked=0, Total=1190 [2019-09-07 09:16:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-07 09:16:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 129. [2019-09-07 09:16:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-07 09:16:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2019-09-07 09:16:25,256 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 37 [2019-09-07 09:16:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:25,257 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2019-09-07 09:16:25,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 09:16:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2019-09-07 09:16:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 09:16:25,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:25,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:25,258 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1250341859, now seen corresponding path program 2 times [2019-09-07 09:16:25,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:25,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:25,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:16:25,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:25,516 INFO L223 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-07 09:16:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:16:25,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:16:25,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:25,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:16:25,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 09:16:25,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:25,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-09-07 09:16:25,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 09:16:25,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 09:16:25,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:16:25,693 INFO L87 Difference]: Start difference. First operand 129 states and 169 transitions. Second operand 16 states. [2019-09-07 09:16:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:26,881 INFO L93 Difference]: Finished difference Result 344 states and 471 transitions. [2019-09-07 09:16:26,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:16:26,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-09-07 09:16:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:26,884 INFO L225 Difference]: With dead ends: 344 [2019-09-07 09:16:26,884 INFO L226 Difference]: Without dead ends: 334 [2019-09-07 09:16:26,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:16:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-07 09:16:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 137. [2019-09-07 09:16:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 09:16:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2019-09-07 09:16:26,907 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 40 [2019-09-07 09:16:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:26,908 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2019-09-07 09:16:26,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 09:16:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2019-09-07 09:16:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 09:16:26,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:26,909 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:26,909 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1289215891, now seen corresponding path program 2 times [2019-09-07 09:16:26,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:26,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:26,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:26,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:26,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 09:16:27,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:27,045 INFO L223 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) [2019-09-07 09:16:27,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:27,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:16:27,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:27,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:16:27,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:16:27,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:27,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 09:16:27,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:16:27,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:16:27,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:16:27,213 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand 15 states. [2019-09-07 09:16:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:27,689 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2019-09-07 09:16:27,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 09:16:27,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-09-07 09:16:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:27,691 INFO L225 Difference]: With dead ends: 197 [2019-09-07 09:16:27,691 INFO L226 Difference]: Without dead ends: 168 [2019-09-07 09:16:27,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:16:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-07 09:16:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2019-09-07 09:16:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-07 09:16:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2019-09-07 09:16:27,708 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 43 [2019-09-07 09:16:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:27,709 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2019-09-07 09:16:27,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:16:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2019-09-07 09:16:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 09:16:27,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:27,710 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:27,711 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:27,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 397852258, now seen corresponding path program 1 times [2019-09-07 09:16:27,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:27,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:27,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:28,483 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2019-09-07 09:16:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:16:28,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:28,525 INFO L223 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) [2019-09-07 09:16:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:28,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 09:16:28,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:28,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:16:28,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:28,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:28,642 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-07 09:16:28,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:1 [2019-09-07 09:16:28,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:28,974 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 31 treesize of output 25 [2019-09-07 09:16:28,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:29,015 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-09-07 09:16:29,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:16:29,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:4 [2019-09-07 09:16:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:29,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:29,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-09-07 09:16:29,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:16:29,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:16:29,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:16:29,052 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand 31 states. [2019-09-07 09:16:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:29,872 INFO L93 Difference]: Finished difference Result 266 states and 350 transitions. [2019-09-07 09:16:29,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:16:29,872 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2019-09-07 09:16:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:29,874 INFO L225 Difference]: With dead ends: 266 [2019-09-07 09:16:29,875 INFO L226 Difference]: Without dead ends: 189 [2019-09-07 09:16:29,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:16:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-07 09:16:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 152. [2019-09-07 09:16:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 09:16:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2019-09-07 09:16:29,898 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 43 [2019-09-07 09:16:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:29,899 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2019-09-07 09:16:29,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:16:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2019-09-07 09:16:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 09:16:29,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:29,900 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:29,900 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1360175746, now seen corresponding path program 1 times [2019-09-07 09:16:29,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:29,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:29,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 09:16:30,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:30,027 INFO L223 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) [2019-09-07 09:16:30,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:30,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:16:30,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 09:16:30,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:30,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-09-07 09:16:30,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:16:30,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:16:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:16:30,187 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand 14 states. [2019-09-07 09:16:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:31,214 INFO L93 Difference]: Finished difference Result 306 states and 402 transitions. [2019-09-07 09:16:31,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 09:16:31,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-09-07 09:16:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:31,218 INFO L225 Difference]: With dead ends: 306 [2019-09-07 09:16:31,218 INFO L226 Difference]: Without dead ends: 247 [2019-09-07 09:16:31,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=1301, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:16:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-07 09:16:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 145. [2019-09-07 09:16:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-07 09:16:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 184 transitions. [2019-09-07 09:16:31,236 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 184 transitions. Word has length 45 [2019-09-07 09:16:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:31,237 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 184 transitions. [2019-09-07 09:16:31,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:16:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2019-09-07 09:16:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 09:16:31,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:31,238 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:31,238 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:31,238 INFO L82 PathProgramCache]: Analyzing trace with hash 601967397, now seen corresponding path program 1 times [2019-09-07 09:16:31,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:31,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:31,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:31,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:31,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 09:16:31,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:31,419 INFO L223 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) [2019-09-07 09:16:31,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:31,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:16:31,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:31,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:16:31,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:31,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:31,512 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-07 09:16:31,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:1 [2019-09-07 09:16:31,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:31,708 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:16:31,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:31,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:31,747 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 55 treesize of output 83 [2019-09-07 09:16:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:31,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:31,775 INFO L567 ElimStorePlain]: treesize reduction 50, result has 28.6 percent of original size [2019-09-07 09:16:31,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:16:31,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:8 [2019-09-07 09:16:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:31,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:31,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2019-09-07 09:16:31,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:16:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:16:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:16:31,805 INFO L87 Difference]: Start difference. First operand 145 states and 184 transitions. Second operand 21 states. [2019-09-07 09:16:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:33,487 INFO L93 Difference]: Finished difference Result 572 states and 781 transitions. [2019-09-07 09:16:33,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:16:33,487 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-09-07 09:16:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:33,490 INFO L225 Difference]: With dead ends: 572 [2019-09-07 09:16:33,490 INFO L226 Difference]: Without dead ends: 437 [2019-09-07 09:16:33,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=1333, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:16:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-07 09:16:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 223. [2019-09-07 09:16:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-07 09:16:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 288 transitions. [2019-09-07 09:16:33,524 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 288 transitions. Word has length 45 [2019-09-07 09:16:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:33,525 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 288 transitions. [2019-09-07 09:16:33,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:16:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 288 transitions. [2019-09-07 09:16:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 09:16:33,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:33,527 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:33,527 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1500355582, now seen corresponding path program 1 times [2019-09-07 09:16:33,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:33,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:33,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:33,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:33,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:16:33,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:33,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:16:33,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:33,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:16:33,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:16:33,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:33,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-09-07 09:16:33,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:16:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:16:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:16:33,853 INFO L87 Difference]: Start difference. First operand 223 states and 288 transitions. Second operand 15 states. [2019-09-07 09:16:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:34,259 INFO L93 Difference]: Finished difference Result 282 states and 361 transitions. [2019-09-07 09:16:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:16:34,260 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-09-07 09:16:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:34,261 INFO L225 Difference]: With dead ends: 282 [2019-09-07 09:16:34,261 INFO L226 Difference]: Without dead ends: 254 [2019-09-07 09:16:34,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:16:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-07 09:16:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2019-09-07 09:16:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-07 09:16:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2019-09-07 09:16:34,291 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 47 [2019-09-07 09:16:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:34,292 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2019-09-07 09:16:34,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:16:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2019-09-07 09:16:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 09:16:34,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:34,293 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:34,293 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2084121899, now seen corresponding path program 1 times [2019-09-07 09:16:34,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:34,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:16:34,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:34,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:16:34,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:34,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:16:34,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:16:34,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:34,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-09-07 09:16:34,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 09:16:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 09:16:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:16:34,898 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand 22 states. [2019-09-07 09:16:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:36,217 INFO L93 Difference]: Finished difference Result 514 states and 700 transitions. [2019-09-07 09:16:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 09:16:36,218 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-07 09:16:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:36,220 INFO L225 Difference]: With dead ends: 514 [2019-09-07 09:16:36,220 INFO L226 Difference]: Without dead ends: 378 [2019-09-07 09:16:36,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:16:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-07 09:16:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 220. [2019-09-07 09:16:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-07 09:16:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 286 transitions. [2019-09-07 09:16:36,259 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 286 transitions. Word has length 46 [2019-09-07 09:16:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:36,259 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 286 transitions. [2019-09-07 09:16:36,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 09:16:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 286 transitions. [2019-09-07 09:16:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 09:16:36,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:36,261 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:36,261 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1121335933, now seen corresponding path program 1 times [2019-09-07 09:16:36,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:36,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 09:16:36,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:36,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:36,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:36,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:16:36,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:36,909 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 15 treesize of output 11 [2019-09-07 09:16:36,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:36,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:36,912 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-07 09:16:36,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-09-07 09:16:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 09:16:37,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:37,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-09-07 09:16:37,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 09:16:37,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 09:16:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:16:37,024 INFO L87 Difference]: Start difference. First operand 220 states and 286 transitions. Second operand 18 states. [2019-09-07 09:16:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:37,472 INFO L93 Difference]: Finished difference Result 295 states and 389 transitions. [2019-09-07 09:16:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 09:16:37,472 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2019-09-07 09:16:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:37,474 INFO L225 Difference]: With dead ends: 295 [2019-09-07 09:16:37,474 INFO L226 Difference]: Without dead ends: 281 [2019-09-07 09:16:37,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:16:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-07 09:16:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 231. [2019-09-07 09:16:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-07 09:16:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 300 transitions. [2019-09-07 09:16:37,503 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 300 transitions. Word has length 51 [2019-09-07 09:16:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:37,503 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 300 transitions. [2019-09-07 09:16:37,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 09:16:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 300 transitions. [2019-09-07 09:16:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 09:16:37,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:37,505 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:37,505 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:37,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash 853558362, now seen corresponding path program 3 times [2019-09-07 09:16:37,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 09:16:37,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:37,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:37,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:16:37,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:16:37,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:37,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:16:37,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:37,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 09:16:37,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:37,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 09:16:37,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 09:16:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 09:16:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:16:37,935 INFO L87 Difference]: Start difference. First operand 231 states and 300 transitions. Second operand 20 states. [2019-09-07 09:16:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:38,680 INFO L93 Difference]: Finished difference Result 284 states and 368 transitions. [2019-09-07 09:16:38,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 09:16:38,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2019-09-07 09:16:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:38,684 INFO L225 Difference]: With dead ends: 284 [2019-09-07 09:16:38,684 INFO L226 Difference]: Without dead ends: 250 [2019-09-07 09:16:38,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:16:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-07 09:16:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2019-09-07 09:16:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-07 09:16:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2019-09-07 09:16:38,714 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 50 [2019-09-07 09:16:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:38,714 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2019-09-07 09:16:38,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 09:16:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2019-09-07 09:16:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 09:16:38,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:38,716 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:38,716 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1510557543, now seen corresponding path program 2 times [2019-09-07 09:16:38,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:38,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:38,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-07 09:16:38,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:38,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:16:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:38,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:16:38,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:38,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 09:16:38,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-07 09:16:39,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:39,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2019-09-07 09:16:39,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:16:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:16:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:16:39,041 INFO L87 Difference]: Start difference. First operand 239 states and 310 transitions. Second operand 14 states. [2019-09-07 09:16:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:39,839 INFO L93 Difference]: Finished difference Result 473 states and 632 transitions. [2019-09-07 09:16:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:16:39,839 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-09-07 09:16:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:39,843 INFO L225 Difference]: With dead ends: 473 [2019-09-07 09:16:39,843 INFO L226 Difference]: Without dead ends: 464 [2019-09-07 09:16:39,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:16:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-07 09:16:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 245. [2019-09-07 09:16:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-07 09:16:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 319 transitions. [2019-09-07 09:16:39,878 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 319 transitions. Word has length 50 [2019-09-07 09:16:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:39,878 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 319 transitions. [2019-09-07 09:16:39,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:16:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 319 transitions. [2019-09-07 09:16:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 09:16:39,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:39,880 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:39,880 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094439, now seen corresponding path program 1 times [2019-09-07 09:16:39,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:39,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:39,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:16:40,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:40,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:40,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:40,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 09:16:40,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:40,505 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 15 treesize of output 11 [2019-09-07 09:16:40,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:40,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:40,507 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-07 09:16:40,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-09-07 09:16:40,823 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-09-07 09:16:40,824 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 42 treesize of output 40 [2019-09-07 09:16:40,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:40,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:40,842 INFO L567 ElimStorePlain]: treesize reduction 14, result has 46.2 percent of original size [2019-09-07 09:16:40,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:16:40,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:3 [2019-09-07 09:16:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:16:40,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:40,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-09-07 09:16:40,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:16:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:16:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:16:40,904 INFO L87 Difference]: Start difference. First operand 245 states and 319 transitions. Second operand 31 states. [2019-09-07 09:16:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:42,316 INFO L93 Difference]: Finished difference Result 323 states and 424 transitions. [2019-09-07 09:16:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:16:42,317 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2019-09-07 09:16:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:42,319 INFO L225 Difference]: With dead ends: 323 [2019-09-07 09:16:42,320 INFO L226 Difference]: Without dead ends: 321 [2019-09-07 09:16:42,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:16:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-07 09:16:42,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 256. [2019-09-07 09:16:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-07 09:16:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 333 transitions. [2019-09-07 09:16:42,354 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 333 transitions. Word has length 52 [2019-09-07 09:16:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:42,354 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 333 transitions. [2019-09-07 09:16:42,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:16:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 333 transitions. [2019-09-07 09:16:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 09:16:42,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:42,356 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:42,356 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash 945322925, now seen corresponding path program 2 times [2019-09-07 09:16:42,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:42,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-07 09:16:42,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:42,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:16:42,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:42,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:16:42,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:42,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:16:42,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:16:42,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:42,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-09-07 09:16:42,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:16:42,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:16:42,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:16:42,618 INFO L87 Difference]: Start difference. First operand 256 states and 333 transitions. Second operand 14 states. [2019-09-07 09:16:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:43,165 INFO L93 Difference]: Finished difference Result 305 states and 393 transitions. [2019-09-07 09:16:43,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 09:16:43,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-09-07 09:16:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:43,167 INFO L225 Difference]: With dead ends: 305 [2019-09-07 09:16:43,167 INFO L226 Difference]: Without dead ends: 261 [2019-09-07 09:16:43,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:16:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-07 09:16:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 256. [2019-09-07 09:16:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-07 09:16:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 331 transitions. [2019-09-07 09:16:43,201 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 331 transitions. Word has length 53 [2019-09-07 09:16:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:43,201 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 331 transitions. [2019-09-07 09:16:43,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:16:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2019-09-07 09:16:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 09:16:43,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:43,203 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:43,203 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 571184028, now seen corresponding path program 2 times [2019-09-07 09:16:43,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:43,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:43,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 09:16:43,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:43,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:43,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:16:43,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:16:43,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:43,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:16:43,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 09:16:43,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:43,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2019-09-07 09:16:43,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 09:16:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 09:16:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:16:43,750 INFO L87 Difference]: Start difference. First operand 256 states and 331 transitions. Second operand 22 states. [2019-09-07 09:16:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:46,014 INFO L93 Difference]: Finished difference Result 844 states and 1130 transitions. [2019-09-07 09:16:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:16:46,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2019-09-07 09:16:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:46,018 INFO L225 Difference]: With dead ends: 844 [2019-09-07 09:16:46,018 INFO L226 Difference]: Without dead ends: 728 [2019-09-07 09:16:46,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=476, Invalid=2604, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:16:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-07 09:16:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 301. [2019-09-07 09:16:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-07 09:16:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 395 transitions. [2019-09-07 09:16:46,068 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 395 transitions. Word has length 52 [2019-09-07 09:16:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:46,069 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 395 transitions. [2019-09-07 09:16:46,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 09:16:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 395 transitions. [2019-09-07 09:16:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 09:16:46,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:46,071 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:46,071 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -932514324, now seen corresponding path program 3 times [2019-09-07 09:16:46,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:46,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:16:47,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:47,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:47,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:16:47,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:16:47,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:47,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 09:16:47,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:47,107 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 15 treesize of output 11 [2019-09-07 09:16:47,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:47,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:47,115 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-07 09:16:47,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 09:16:47,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:47,311 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 26 treesize of output 18 [2019-09-07 09:16:47,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:47,317 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-09-07 09:16:47,317 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-07 09:16:47,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-09-07 09:16:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:16:47,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:47,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 27 [2019-09-07 09:16:47,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 09:16:47,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 09:16:47,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:16:47,351 INFO L87 Difference]: Start difference. First operand 301 states and 395 transitions. Second operand 27 states. [2019-09-07 09:16:48,297 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-07 09:16:48,491 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 09:16:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:49,284 INFO L93 Difference]: Finished difference Result 587 states and 780 transitions. [2019-09-07 09:16:49,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:16:49,285 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-09-07 09:16:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:49,288 INFO L225 Difference]: With dead ends: 587 [2019-09-07 09:16:49,288 INFO L226 Difference]: Without dead ends: 462 [2019-09-07 09:16:49,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:16:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-07 09:16:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 303. [2019-09-07 09:16:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-07 09:16:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 392 transitions. [2019-09-07 09:16:49,333 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 392 transitions. Word has length 53 [2019-09-07 09:16:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:49,333 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 392 transitions. [2019-09-07 09:16:49,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 09:16:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 392 transitions. [2019-09-07 09:16:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 09:16:49,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:49,335 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:49,336 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1650271144, now seen corresponding path program 4 times [2019-09-07 09:16:49,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:49,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:49,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:16:50,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:50,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:50,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:16:50,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:16:50,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:50,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-07 09:16:50,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:50,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:16:50,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:50,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:50,562 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-07 09:16:50,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 09:16:50,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:16:50,905 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:16:50,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:50,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:16:50,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:16:50,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:50,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 27 [2019-09-07 09:16:50,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:50,925 INFO L567 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-09-07 09:16:50,925 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-07 09:16:50,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:4 [2019-09-07 09:16:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:50,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:50,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 33 [2019-09-07 09:16:50,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 09:16:50,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 09:16:50,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:16:50,974 INFO L87 Difference]: Start difference. First operand 303 states and 392 transitions. Second operand 33 states. [2019-09-07 09:16:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:52,218 INFO L93 Difference]: Finished difference Result 543 states and 708 transitions. [2019-09-07 09:16:52,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:16:52,218 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2019-09-07 09:16:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:52,221 INFO L225 Difference]: With dead ends: 543 [2019-09-07 09:16:52,221 INFO L226 Difference]: Without dead ends: 497 [2019-09-07 09:16:52,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:16:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-07 09:16:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 315. [2019-09-07 09:16:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-07 09:16:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 405 transitions. [2019-09-07 09:16:52,264 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 405 transitions. Word has length 53 [2019-09-07 09:16:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:52,264 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 405 transitions. [2019-09-07 09:16:52,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 09:16:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 405 transitions. [2019-09-07 09:16:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 09:16:52,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:52,266 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:52,267 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1416796090, now seen corresponding path program 5 times [2019-09-07 09:16:52,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:52,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:52,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:52,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:52,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:16:53,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:53,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:16:53,168 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:53,933 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 09:16:53,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:53,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 09:16:53,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:54,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:16:54,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:54,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:54,066 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-07 09:16:54,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-09-07 09:16:54,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:16:54,500 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 31 treesize of output 25 [2019-09-07 09:16:54,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:16:54,518 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-09-07 09:16:54,519 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-07 09:16:54,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-09-07 09:16:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:16:54,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:54,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 09:16:54,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:16:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:16:54,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:16:54,554 INFO L87 Difference]: Start difference. First operand 315 states and 405 transitions. Second operand 39 states. [2019-09-07 09:16:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:56,096 INFO L93 Difference]: Finished difference Result 636 states and 827 transitions. [2019-09-07 09:16:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:16:56,097 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2019-09-07 09:16:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:56,099 INFO L225 Difference]: With dead ends: 636 [2019-09-07 09:16:56,099 INFO L226 Difference]: Without dead ends: 509 [2019-09-07 09:16:56,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=218, Invalid=2232, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:16:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-07 09:16:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 333. [2019-09-07 09:16:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-07 09:16:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 427 transitions. [2019-09-07 09:16:56,148 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 427 transitions. Word has length 53 [2019-09-07 09:16:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:56,149 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 427 transitions. [2019-09-07 09:16:56,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:16:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 427 transitions. [2019-09-07 09:16:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 09:16:56,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:56,151 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:56,152 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash -888032661, now seen corresponding path program 3 times [2019-09-07 09:16:56,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:56,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:16:56,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:56,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:56,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:16:56,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:16:56,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:56,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:16:56,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:16:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:56,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-09-07 09:16:56,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:16:56,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:16:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:16:56,485 INFO L87 Difference]: Start difference. First operand 333 states and 427 transitions. Second operand 14 states. [2019-09-07 09:16:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:57,216 INFO L93 Difference]: Finished difference Result 467 states and 600 transitions. [2019-09-07 09:16:57,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:16:57,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-09-07 09:16:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:57,219 INFO L225 Difference]: With dead ends: 467 [2019-09-07 09:16:57,219 INFO L226 Difference]: Without dead ends: 437 [2019-09-07 09:16:57,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:16:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-07 09:16:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 349. [2019-09-07 09:16:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-07 09:16:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 447 transitions. [2019-09-07 09:16:57,266 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 447 transitions. Word has length 55 [2019-09-07 09:16:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:57,266 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 447 transitions. [2019-09-07 09:16:57,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:16:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 447 transitions. [2019-09-07 09:16:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 09:16:57,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:57,268 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:57,269 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1308438307, now seen corresponding path program 1 times [2019-09-07 09:16:57,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:57,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:16:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:16:57,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:57,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:16:57,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:57,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:16:57,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 09:16:57,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:57,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-07 09:16:57,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 09:16:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 09:16:57,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:16:57,603 INFO L87 Difference]: Start difference. First operand 349 states and 447 transitions. Second operand 20 states. [2019-09-07 09:16:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:16:58,360 INFO L93 Difference]: Finished difference Result 473 states and 603 transitions. [2019-09-07 09:16:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:16:58,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-07 09:16:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:16:58,363 INFO L225 Difference]: With dead ends: 473 [2019-09-07 09:16:58,363 INFO L226 Difference]: Without dead ends: 374 [2019-09-07 09:16:58,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:16:58,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-07 09:16:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 355. [2019-09-07 09:16:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-07 09:16:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 452 transitions. [2019-09-07 09:16:58,417 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 452 transitions. Word has length 54 [2019-09-07 09:16:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:16:58,418 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 452 transitions. [2019-09-07 09:16:58,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 09:16:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 452 transitions. [2019-09-07 09:16:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 09:16:58,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:16:58,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:16:58,420 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:16:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:16:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash 148066665, now seen corresponding path program 4 times [2019-09-07 09:16:58,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:16:58,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:16:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:58,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:16:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:16:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:16:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 09:16:58,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:16:58,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:16:58,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:16:58,762 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:16:58,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:16:58,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:16:58,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:16:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 09:16:59,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:16:59,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2019-09-07 09:16:59,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:16:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:16:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:16:59,015 INFO L87 Difference]: Start difference. First operand 355 states and 452 transitions. Second operand 21 states. [2019-09-07 09:17:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:00,169 INFO L93 Difference]: Finished difference Result 458 states and 579 transitions. [2019-09-07 09:17:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 09:17:00,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-09-07 09:17:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:00,172 INFO L225 Difference]: With dead ends: 458 [2019-09-07 09:17:00,173 INFO L226 Difference]: Without dead ends: 381 [2019-09-07 09:17:00,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:17:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-07 09:17:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 334. [2019-09-07 09:17:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-07 09:17:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 419 transitions. [2019-09-07 09:17:00,215 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 419 transitions. Word has length 57 [2019-09-07 09:17:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:00,215 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 419 transitions. [2019-09-07 09:17:00,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:17:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 419 transitions. [2019-09-07 09:17:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 09:17:00,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:00,217 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:00,217 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:00,218 INFO L82 PathProgramCache]: Analyzing trace with hash -724744989, now seen corresponding path program 6 times [2019-09-07 09:17:00,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:00,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:00,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:00,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:00,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 09:17:00,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:00,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:17:00,534 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-09-07 09:17:00,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:00,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 09:17:00,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:00,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:17:00,769 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:17:00,771 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:17:00,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:00,776 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 30 [2019-09-07 09:17:00,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:00,780 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:17:00,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:00,790 INFO L567 ElimStorePlain]: treesize reduction 17, result has 29.2 percent of original size [2019-09-07 09:17:00,791 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-07 09:17:00,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:7 [2019-09-07 09:17:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 09:17:00,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:00,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-09-07 09:17:00,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:17:00,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:17:00,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:17:00,825 INFO L87 Difference]: Start difference. First operand 334 states and 419 transitions. Second operand 24 states. [2019-09-07 09:17:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:03,069 INFO L93 Difference]: Finished difference Result 852 states and 1134 transitions. [2019-09-07 09:17:03,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 09:17:03,070 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-09-07 09:17:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:03,073 INFO L225 Difference]: With dead ends: 852 [2019-09-07 09:17:03,074 INFO L226 Difference]: Without dead ends: 665 [2019-09-07 09:17:03,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=251, Invalid=2199, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:17:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-07 09:17:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 364. [2019-09-07 09:17:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-07 09:17:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 471 transitions. [2019-09-07 09:17:03,132 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 471 transitions. Word has length 56 [2019-09-07 09:17:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:03,132 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 471 transitions. [2019-09-07 09:17:03,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:17:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 471 transitions. [2019-09-07 09:17:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 09:17:03,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:03,135 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:03,135 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash -531480061, now seen corresponding path program 3 times [2019-09-07 09:17:03,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:03,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:03,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 09:17:03,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:03,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:03,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:17:16,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 09:17:16,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:16,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-07 09:17:16,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:16,202 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 15 treesize of output 11 [2019-09-07 09:17:16,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:16,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:16,211 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-07 09:17:16,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-07 09:17:16,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:17:16,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:16,762 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 27 treesize of output 19 [2019-09-07 09:17:16,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:16,776 INFO L567 ElimStorePlain]: treesize reduction 4, result has 69.2 percent of original size [2019-09-07 09:17:16,776 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-07 09:17:16,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:4 [2019-09-07 09:17:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:17:16,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:16,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 35 [2019-09-07 09:17:16,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:17:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:17:16,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:17:16,816 INFO L87 Difference]: Start difference. First operand 364 states and 471 transitions. Second operand 35 states. [2019-09-07 09:17:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:18,651 INFO L93 Difference]: Finished difference Result 631 states and 833 transitions. [2019-09-07 09:17:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:17:18,651 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2019-09-07 09:17:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:18,654 INFO L225 Difference]: With dead ends: 631 [2019-09-07 09:17:18,654 INFO L226 Difference]: Without dead ends: 552 [2019-09-07 09:17:18,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=210, Invalid=2046, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 09:17:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-07 09:17:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 398. [2019-09-07 09:17:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-07 09:17:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 510 transitions. [2019-09-07 09:17:18,717 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 510 transitions. Word has length 57 [2019-09-07 09:17:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:18,717 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 510 transitions. [2019-09-07 09:17:18,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:17:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 510 transitions. [2019-09-07 09:17:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 09:17:18,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:18,719 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:18,720 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:18,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1454993047, now seen corresponding path program 7 times [2019-09-07 09:17:18,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:18,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:18,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:17:19,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:19,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:17:19,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:19,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:17:19,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 09:17:19,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:19,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 31 [2019-09-07 09:17:19,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:17:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:17:19,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:17:19,855 INFO L87 Difference]: Start difference. First operand 398 states and 510 transitions. Second operand 31 states. [2019-09-07 09:17:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:26,036 INFO L93 Difference]: Finished difference Result 1959 states and 2636 transitions. [2019-09-07 09:17:26,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-07 09:17:26,037 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-09-07 09:17:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:26,046 INFO L225 Difference]: With dead ends: 1959 [2019-09-07 09:17:26,046 INFO L226 Difference]: Without dead ends: 1850 [2019-09-07 09:17:26,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1861 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=676, Invalid=5644, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 09:17:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-09-07 09:17:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 363. [2019-09-07 09:17:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-07 09:17:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 461 transitions. [2019-09-07 09:17:26,125 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 461 transitions. Word has length 58 [2019-09-07 09:17:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:26,125 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 461 transitions. [2019-09-07 09:17:26,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:17:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 461 transitions. [2019-09-07 09:17:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 09:17:26,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:26,127 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:26,128 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1791596869, now seen corresponding path program 3 times [2019-09-07 09:17:26,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:26,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:26,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:17:26,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:26,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:26,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:17:28,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 09:17:28,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:28,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 09:17:28,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 45 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 09:17:29,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:29,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2019-09-07 09:17:29,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:17:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:17:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:17:29,139 INFO L87 Difference]: Start difference. First operand 363 states and 461 transitions. Second operand 30 states. [2019-09-07 09:17:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:31,211 INFO L93 Difference]: Finished difference Result 460 states and 585 transitions. [2019-09-07 09:17:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 09:17:31,211 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2019-09-07 09:17:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:31,213 INFO L225 Difference]: With dead ends: 460 [2019-09-07 09:17:31,213 INFO L226 Difference]: Without dead ends: 415 [2019-09-07 09:17:31,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=282, Invalid=2688, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:17:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-07 09:17:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 374. [2019-09-07 09:17:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-07 09:17:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 475 transitions. [2019-09-07 09:17:31,279 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 475 transitions. Word has length 60 [2019-09-07 09:17:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:31,280 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 475 transitions. [2019-09-07 09:17:31,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:17:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 475 transitions. [2019-09-07 09:17:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 09:17:31,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:31,282 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:31,283 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash -305944018, now seen corresponding path program 1 times [2019-09-07 09:17:31,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:31,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:31,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 09:17:31,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:31,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:31,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:32,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 09:17:32,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:32,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:17:32,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:32,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:32,100 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-07 09:17:32,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:1 [2019-09-07 09:17:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 09:17:32,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:32,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-09-07 09:17:32,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:17:32,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:17:32,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:17:32,367 INFO L87 Difference]: Start difference. First operand 374 states and 475 transitions. Second operand 30 states. [2019-09-07 09:17:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:33,431 INFO L93 Difference]: Finished difference Result 477 states and 612 transitions. [2019-09-07 09:17:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:17:33,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2019-09-07 09:17:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:33,434 INFO L225 Difference]: With dead ends: 477 [2019-09-07 09:17:33,434 INFO L226 Difference]: Without dead ends: 463 [2019-09-07 09:17:33,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:17:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-07 09:17:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 386. [2019-09-07 09:17:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-09-07 09:17:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 490 transitions. [2019-09-07 09:17:33,504 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 490 transitions. Word has length 61 [2019-09-07 09:17:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:33,504 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 490 transitions. [2019-09-07 09:17:33,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:17:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 490 transitions. [2019-09-07 09:17:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 09:17:33,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:33,509 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:33,509 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash -204752096, now seen corresponding path program 1 times [2019-09-07 09:17:33,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:33,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:33,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:33,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:33,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:17:34,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:34,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:34,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:34,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 09:17:34,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:34,280 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 15 treesize of output 11 [2019-09-07 09:17:34,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:34,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:34,282 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-07 09:17:34,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-09-07 09:17:34,751 INFO L341 Elim1Store]: treesize reduction 20, result has 74.0 percent of original size [2019-09-07 09:17:34,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 69 [2019-09-07 09:17:34,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:17:34,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:34,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:34,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:17:34,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:3 [2019-09-07 09:17:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:17:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2019-09-07 09:17:34,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:17:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:17:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:17:34,818 INFO L87 Difference]: Start difference. First operand 386 states and 490 transitions. Second operand 38 states. [2019-09-07 09:17:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:36,578 INFO L93 Difference]: Finished difference Result 620 states and 794 transitions. [2019-09-07 09:17:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 09:17:36,578 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 62 [2019-09-07 09:17:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:36,580 INFO L225 Difference]: With dead ends: 620 [2019-09-07 09:17:36,580 INFO L226 Difference]: Without dead ends: 513 [2019-09-07 09:17:36,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=2153, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:17:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-07 09:17:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 395. [2019-09-07 09:17:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-07 09:17:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 500 transitions. [2019-09-07 09:17:36,653 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 500 transitions. Word has length 62 [2019-09-07 09:17:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:36,653 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 500 transitions. [2019-09-07 09:17:36,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:17:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 500 transitions. [2019-09-07 09:17:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 09:17:36,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:36,655 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:36,655 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1025359598, now seen corresponding path program 2 times [2019-09-07 09:17:36,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:36,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 09:17:37,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:37,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:37,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:17:37,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:37,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:37,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:17:37,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:37,332 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 15 treesize of output 11 [2019-09-07 09:17:37,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:37,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:37,338 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-07 09:17:37,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 09:17:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-07 09:17:37,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:37,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2019-09-07 09:17:37,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:17:37,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:17:37,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:17:37,456 INFO L87 Difference]: Start difference. First operand 395 states and 500 transitions. Second operand 17 states. [2019-09-07 09:17:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:40,873 INFO L93 Difference]: Finished difference Result 527 states and 670 transitions. [2019-09-07 09:17:40,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:17:40,874 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2019-09-07 09:17:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:40,876 INFO L225 Difference]: With dead ends: 527 [2019-09-07 09:17:40,876 INFO L226 Difference]: Without dead ends: 510 [2019-09-07 09:17:40,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:17:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-07 09:17:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 399. [2019-09-07 09:17:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-07 09:17:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 502 transitions. [2019-09-07 09:17:40,962 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 502 transitions. Word has length 62 [2019-09-07 09:17:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:40,962 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 502 transitions. [2019-09-07 09:17:40,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:17:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 502 transitions. [2019-09-07 09:17:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 09:17:40,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:40,964 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:40,965 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash -782159456, now seen corresponding path program 2 times [2019-09-07 09:17:40,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:40,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 09:17:41,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:17:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 09:17:41,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:17:41,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:17:41,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:17:41,031 INFO L87 Difference]: Start difference. First operand 399 states and 502 transitions. Second operand 6 states. [2019-09-07 09:17:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:41,145 INFO L93 Difference]: Finished difference Result 419 states and 527 transitions. [2019-09-07 09:17:41,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:17:41,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-07 09:17:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:41,149 INFO L225 Difference]: With dead ends: 419 [2019-09-07 09:17:41,149 INFO L226 Difference]: Without dead ends: 406 [2019-09-07 09:17:41,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:17:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-07 09:17:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2019-09-07 09:17:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-07 09:17:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 504 transitions. [2019-09-07 09:17:41,215 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 504 transitions. Word has length 63 [2019-09-07 09:17:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:41,215 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 504 transitions. [2019-09-07 09:17:41,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:17:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 504 transitions. [2019-09-07 09:17:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 09:17:41,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:41,217 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:41,217 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:41,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1802634100, now seen corresponding path program 2 times [2019-09-07 09:17:41,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:41,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:41,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:41,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 09:17:41,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:41,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:17:41,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:41,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:41,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:41,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:17:41,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 09:17:41,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:41,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2019-09-07 09:17:41,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:17:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:17:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:17:41,608 INFO L87 Difference]: Start difference. First operand 403 states and 504 transitions. Second operand 17 states. [2019-09-07 09:17:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:42,514 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2019-09-07 09:17:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:17:42,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2019-09-07 09:17:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:42,516 INFO L225 Difference]: With dead ends: 519 [2019-09-07 09:17:42,516 INFO L226 Difference]: Without dead ends: 458 [2019-09-07 09:17:42,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:17:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-07 09:17:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 424. [2019-09-07 09:17:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-07 09:17:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 525 transitions. [2019-09-07 09:17:42,603 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 525 transitions. Word has length 64 [2019-09-07 09:17:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:42,603 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 525 transitions. [2019-09-07 09:17:42,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:17:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 525 transitions. [2019-09-07 09:17:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 09:17:42,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:42,606 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:42,606 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1966621658, now seen corresponding path program 8 times [2019-09-07 09:17:42,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:42,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:17:43,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:43,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:43,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:17:43,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:43,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:43,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-07 09:17:43,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:43,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:17:43,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:44,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:44,008 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-07 09:17:44,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 09:17:44,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:17:44,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:17:44,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:17:44,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:17:44,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:17:44,615 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 24 [2019-09-07 09:17:44,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:44,619 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:17:44,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:17:44,632 INFO L567 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-09-07 09:17:44,632 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-07 09:17:44,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:4 [2019-09-07 09:17:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:17:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:44,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 38 [2019-09-07 09:17:44,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:17:44,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:17:44,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:17:44,673 INFO L87 Difference]: Start difference. First operand 424 states and 525 transitions. Second operand 38 states. [2019-09-07 09:17:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:47,057 INFO L93 Difference]: Finished difference Result 822 states and 1022 transitions. [2019-09-07 09:17:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:17:47,057 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 63 [2019-09-07 09:17:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:47,061 INFO L225 Difference]: With dead ends: 822 [2019-09-07 09:17:47,061 INFO L226 Difference]: Without dead ends: 705 [2019-09-07 09:17:47,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=188, Invalid=2164, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:17:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-07 09:17:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 433. [2019-09-07 09:17:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-09-07 09:17:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 535 transitions. [2019-09-07 09:17:47,143 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 535 transitions. Word has length 63 [2019-09-07 09:17:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:47,143 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 535 transitions. [2019-09-07 09:17:47,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:17:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 535 transitions. [2019-09-07 09:17:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 09:17:47,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:47,145 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:47,145 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1198291344, now seen corresponding path program 9 times [2019-09-07 09:17:47,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:47,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:47,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:17:48,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:48,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:18:13,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 09:18:13,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:13,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-07 09:18:13,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:13,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-09-07 09:18:13,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:13,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:13,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:18:13,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-09-07 09:18:13,849 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 15 treesize of output 11 [2019-09-07 09:18:13,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:13,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:13,856 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-07 09:18:13,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-07 09:18:14,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:18:14,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:18:14,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:18:14,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:18:14,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:14,400 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 29 [2019-09-07 09:18:14,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:14,404 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:18:14,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:14,419 INFO L567 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-09-07 09:18:14,420 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-07 09:18:14,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:14 [2019-09-07 09:18:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Stream closed [2019-09-07 09:18:14,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:14,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 40 [2019-09-07 09:18:14,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 09:18:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 09:18:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:18:14,475 INFO L87 Difference]: Start difference. First operand 433 states and 535 transitions. Second operand 40 states. [2019-09-07 09:18:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:16,624 INFO L93 Difference]: Finished difference Result 744 states and 926 transitions. [2019-09-07 09:18:16,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:18:16,624 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 63 [2019-09-07 09:18:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:16,628 INFO L225 Difference]: With dead ends: 744 [2019-09-07 09:18:16,628 INFO L226 Difference]: Without dead ends: 710 [2019-09-07 09:18:16,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=199, Invalid=2351, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:18:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-07 09:18:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 442. [2019-09-07 09:18:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-07 09:18:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 545 transitions. [2019-09-07 09:18:16,707 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 545 transitions. Word has length 63 [2019-09-07 09:18:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:16,707 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 545 transitions. [2019-09-07 09:18:16,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 09:18:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 545 transitions. [2019-09-07 09:18:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 09:18:16,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:16,709 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:16,709 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash -249372646, now seen corresponding path program 10 times [2019-09-07 09:18:16,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:16,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:16,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:18:17,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:17,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:18:17,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:18:17,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:18:17,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:17,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 09:18:17,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:18,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:18:18,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:18,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:18,050 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-07 09:18:18,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 09:18:18,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:18:18,536 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:18:18,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:18,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:18:18,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:18:18,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:18:18,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:18,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 29 [2019-09-07 09:18:18,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:18,562 INFO L567 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-09-07 09:18:18,563 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-07 09:18:18,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:4 [2019-09-07 09:18:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:18:18,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:18,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 39 [2019-09-07 09:18:18,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:18:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:18:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1355, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:18:18,604 INFO L87 Difference]: Start difference. First operand 442 states and 545 transitions. Second operand 39 states. [2019-09-07 09:18:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:20,866 INFO L93 Difference]: Finished difference Result 838 states and 1043 transitions. [2019-09-07 09:18:20,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:18:20,866 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 63 [2019-09-07 09:18:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:20,869 INFO L225 Difference]: With dead ends: 838 [2019-09-07 09:18:20,869 INFO L226 Difference]: Without dead ends: 719 [2019-09-07 09:18:20,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=2258, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:18:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-07 09:18:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 453. [2019-09-07 09:18:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-09-07 09:18:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 558 transitions. [2019-09-07 09:18:20,958 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 558 transitions. Word has length 63 [2019-09-07 09:18:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:20,958 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 558 transitions. [2019-09-07 09:18:20,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:18:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 558 transitions. [2019-09-07 09:18:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 09:18:20,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:20,960 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:20,960 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -667926329, now seen corresponding path program 2 times [2019-09-07 09:18:20,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:20,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:20,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 09:18:21,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:21,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:18:21,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:18:21,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:18:21,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:21,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:18:21,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:18:21,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:21,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 09:18:21,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:18:21,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:18:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:18:21,422 INFO L87 Difference]: Start difference. First operand 453 states and 558 transitions. Second operand 25 states. [2019-09-07 09:18:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:23,065 INFO L93 Difference]: Finished difference Result 765 states and 941 transitions. [2019-09-07 09:18:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:18:23,065 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 64 [2019-09-07 09:18:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:23,068 INFO L225 Difference]: With dead ends: 765 [2019-09-07 09:18:23,068 INFO L226 Difference]: Without dead ends: 585 [2019-09-07 09:18:23,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=2457, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:18:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-07 09:18:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 459. [2019-09-07 09:18:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-09-07 09:18:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 563 transitions. [2019-09-07 09:18:23,131 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 563 transitions. Word has length 64 [2019-09-07 09:18:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:23,132 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 563 transitions. [2019-09-07 09:18:23,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:18:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 563 transitions. [2019-09-07 09:18:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 09:18:23,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:23,134 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:23,134 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1238616566, now seen corresponding path program 3 times [2019-09-07 09:18:23,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:23,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:23,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:23,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 09:18:23,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:23,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:18:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:18:23,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 09:18:23,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:23,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:18:23,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:23,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:18:23,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:23,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:23,506 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-07 09:18:23,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 09:18:23,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:18:23,796 INFO L341 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2019-09-07 09:18:23,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 22 [2019-09-07 09:18:23,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:23,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:23,799 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-07 09:18:23,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:1 [2019-09-07 09:18:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:18:23,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:23,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2019-09-07 09:18:23,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 09:18:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 09:18:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:18:23,813 INFO L87 Difference]: Start difference. First operand 459 states and 563 transitions. Second operand 27 states. [2019-09-07 09:18:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:27,147 INFO L93 Difference]: Finished difference Result 993 states and 1253 transitions. [2019-09-07 09:18:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 09:18:27,148 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2019-09-07 09:18:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:27,151 INFO L225 Difference]: With dead ends: 993 [2019-09-07 09:18:27,151 INFO L226 Difference]: Without dead ends: 906 [2019-09-07 09:18:27,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=412, Invalid=4010, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 09:18:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-07 09:18:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 459. [2019-09-07 09:18:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-09-07 09:18:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 557 transitions. [2019-09-07 09:18:27,224 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 557 transitions. Word has length 66 [2019-09-07 09:18:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:27,224 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 557 transitions. [2019-09-07 09:18:27,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 09:18:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 557 transitions. [2019-09-07 09:18:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 09:18:27,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:27,225 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:27,225 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:27,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:27,226 INFO L82 PathProgramCache]: Analyzing trace with hash 479366237, now seen corresponding path program 4 times [2019-09-07 09:18:27,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:27,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:27,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-07 09:18:27,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:27,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:18:27,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:18:27,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:18:27,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:27,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-07 09:18:27,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:27,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:18:27,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:27,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:27,784 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-07 09:18:27,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2019-09-07 09:18:28,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:18:28,314 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 27 treesize of output 19 [2019-09-07 09:18:28,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:18:28,336 INFO L567 ElimStorePlain]: treesize reduction 4, result has 69.2 percent of original size [2019-09-07 09:18:28,337 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-07 09:18:28,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:4 [2019-09-07 09:18:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:18:28,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:28,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 40 [2019-09-07 09:18:28,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 09:18:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 09:18:28,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:18:28,381 INFO L87 Difference]: Start difference. First operand 459 states and 557 transitions. Second operand 40 states. [2019-09-07 09:18:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:36,074 INFO L93 Difference]: Finished difference Result 1544 states and 1946 transitions. [2019-09-07 09:18:36,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 09:18:36,075 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 65 [2019-09-07 09:18:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:36,080 INFO L225 Difference]: With dead ends: 1544 [2019-09-07 09:18:36,080 INFO L226 Difference]: Without dead ends: 1331 [2019-09-07 09:18:36,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3260 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1088, Invalid=10254, Unknown=0, NotChecked=0, Total=11342 [2019-09-07 09:18:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-09-07 09:18:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 585. [2019-09-07 09:18:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-07 09:18:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 718 transitions. [2019-09-07 09:18:36,165 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 718 transitions. Word has length 65 [2019-09-07 09:18:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:36,165 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 718 transitions. [2019-09-07 09:18:36,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 09:18:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 718 transitions. [2019-09-07 09:18:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 09:18:36,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:36,167 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:36,168 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1723026979, now seen corresponding path program 11 times [2019-09-07 09:18:36,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:36,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:36,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:36,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:36,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 09:18:36,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:36,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:18:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:19:00,984 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 09:19:00,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:01,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:19:01,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 09:19:01,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:01,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 30 [2019-09-07 09:19:01,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:19:01,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:19:01,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:19:01,269 INFO L87 Difference]: Start difference. First operand 585 states and 718 transitions. Second operand 30 states. [2019-09-07 09:19:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:03,645 INFO L93 Difference]: Finished difference Result 1478 states and 1918 transitions. [2019-09-07 09:19:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 09:19:03,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-09-07 09:19:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:03,649 INFO L225 Difference]: With dead ends: 1478 [2019-09-07 09:19:03,649 INFO L226 Difference]: Without dead ends: 1164 [2019-09-07 09:19:03,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=2174, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:19:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-09-07 09:19:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 622. [2019-09-07 09:19:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-07 09:19:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 796 transitions. [2019-09-07 09:19:03,744 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 796 transitions. Word has length 66 [2019-09-07 09:19:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:03,744 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 796 transitions. [2019-09-07 09:19:03,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:19:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 796 transitions. [2019-09-07 09:19:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 09:19:03,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:03,746 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:03,747 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1680414105, now seen corresponding path program 4 times [2019-09-07 09:19:03,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:03,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:03,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:03,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:03,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 09:19:03,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:03,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:19:03,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:04,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:19:04,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:04,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:19:04,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 49 proven. 9 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-07 09:19:04,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2019-09-07 09:19:04,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:19:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:19:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:19:04,155 INFO L87 Difference]: Start difference. First operand 622 states and 796 transitions. Second operand 21 states. [2019-09-07 09:19:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:04,929 INFO L93 Difference]: Finished difference Result 690 states and 882 transitions. [2019-09-07 09:19:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:19:04,929 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-09-07 09:19:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:04,932 INFO L225 Difference]: With dead ends: 690 [2019-09-07 09:19:04,932 INFO L226 Difference]: Without dead ends: 631 [2019-09-07 09:19:04,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:19:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-07 09:19:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 620. [2019-09-07 09:19:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-07 09:19:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 794 transitions. [2019-09-07 09:19:05,017 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 794 transitions. Word has length 68 [2019-09-07 09:19:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:05,017 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 794 transitions. [2019-09-07 09:19:05,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:19:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 794 transitions. [2019-09-07 09:19:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 09:19:05,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:05,020 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:05,020 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1120624193, now seen corresponding path program 1 times [2019-09-07 09:19:05,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:05,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:05,517 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-09-07 09:19:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 09:19:05,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:05,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:05,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:05,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 09:19:05,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:05,941 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 15 treesize of output 11 [2019-09-07 09:19:05,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:05,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:05,944 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-07 09:19:05,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-09-07 09:19:08,554 INFO L341 Elim1Store]: treesize reduction 20, result has 74.0 percent of original size [2019-09-07 09:19:08,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 70 [2019-09-07 09:19:08,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:08,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:08,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:08,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:08,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:08,585 INFO L567 ElimStorePlain]: treesize reduction 31, result has 27.9 percent of original size [2019-09-07 09:19:08,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:19:08,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:3 [2019-09-07 09:19:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:19:08,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:08,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2019-09-07 09:19:08,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:19:08,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:19:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1362, Unknown=1, NotChecked=0, Total=1482 [2019-09-07 09:19:08,650 INFO L87 Difference]: Start difference. First operand 620 states and 794 transitions. Second operand 39 states. [2019-09-07 09:19:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:43,296 INFO L93 Difference]: Finished difference Result 960 states and 1234 transitions. [2019-09-07 09:19:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:19:43,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 70 [2019-09-07 09:19:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:43,301 INFO L225 Difference]: With dead ends: 960 [2019-09-07 09:19:43,301 INFO L226 Difference]: Without dead ends: 764 [2019-09-07 09:19:43,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=236, Invalid=2518, Unknown=2, NotChecked=0, Total=2756 [2019-09-07 09:19:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-07 09:19:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 607. [2019-09-07 09:19:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-07 09:19:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 773 transitions. [2019-09-07 09:19:43,465 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 773 transitions. Word has length 70 [2019-09-07 09:19:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:43,466 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 773 transitions. [2019-09-07 09:19:43,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:19:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 773 transitions. [2019-09-07 09:19:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 09:19:43,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:43,468 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:43,468 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:43,469 INFO L82 PathProgramCache]: Analyzing trace with hash -150963444, now seen corresponding path program 3 times [2019-09-07 09:19:43,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:43,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:43,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:43,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 09:19:44,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:44,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:44,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:19:44,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 09:19:44,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:44,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 09:19:44,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 09:19:44,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:44,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2019-09-07 09:19:44,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 09:19:44,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 09:19:44,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:19:44,746 INFO L87 Difference]: Start difference. First operand 607 states and 773 transitions. Second operand 32 states. [2019-09-07 09:19:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:46,996 INFO L93 Difference]: Finished difference Result 883 states and 1117 transitions. [2019-09-07 09:19:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 09:19:46,997 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-09-07 09:19:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:46,999 INFO L225 Difference]: With dead ends: 883 [2019-09-07 09:19:47,000 INFO L226 Difference]: Without dead ends: 725 [2019-09-07 09:19:47,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=2498, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:19:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-09-07 09:19:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 605. [2019-09-07 09:19:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-07 09:19:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 765 transitions. [2019-09-07 09:19:47,083 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 765 transitions. Word has length 69 [2019-09-07 09:19:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:47,084 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 765 transitions. [2019-09-07 09:19:47,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 09:19:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 765 transitions. [2019-09-07 09:19:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 09:19:47,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:47,085 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:47,085 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash -402425825, now seen corresponding path program 12 times [2019-09-07 09:19:47,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:47,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:47,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:47,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:47,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:19:47,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:47,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:47,907 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:20:00,083 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-07 09:20:00,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:00,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:20:00,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:20:00,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:00,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 37 [2019-09-07 09:20:00,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 09:20:00,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 09:20:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:20:00,646 INFO L87 Difference]: Start difference. First operand 605 states and 765 transitions. Second operand 37 states. [2019-09-07 09:20:05,630 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-09-07 09:20:21,542 WARN L188 SmtUtils]: Spent 15.79 s on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-07 09:20:26,153 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-07 09:20:29,738 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-07 09:20:35,447 WARN L188 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-07 09:20:36,045 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-07 09:20:42,384 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-07 09:20:53,313 WARN L188 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-07 09:20:58,129 WARN L188 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 09:21:06,399 WARN L188 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-07 09:21:12,810 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-07 09:21:13,060 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-07 09:21:30,786 WARN L188 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-07 09:21:35,639 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-07 09:21:44,115 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-07 09:22:03,435 WARN L188 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-07 09:22:20,515 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-07 09:22:23,570 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 09:22:37,570 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-07 09:23:15,656 WARN L188 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-07 09:23:26,846 WARN L188 SmtUtils]: Spent 9.10 s on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-07 09:23:32,662 WARN L188 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-07 09:23:50,047 WARN L188 SmtUtils]: Spent 10.12 s on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 09:23:54,691 WARN L188 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-07 09:24:04,455 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-07 09:24:17,217 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-07 09:24:34,754 WARN L188 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-07 09:24:47,925 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-07 09:24:49,453 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-07 09:24:57,682 WARN L188 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-07 09:25:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:25:10,667 INFO L93 Difference]: Finished difference Result 3563 states and 4541 transitions. [2019-09-07 09:25:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 09:25:10,667 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-09-07 09:25:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:25:10,679 INFO L225 Difference]: With dead ends: 3563 [2019-09-07 09:25:10,679 INFO L226 Difference]: Without dead ends: 3381 [2019-09-07 09:25:10,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4895 ImplicationChecksByTransitivity, 280.6s TimeCoverageRelationStatistics Valid=1406, Invalid=13320, Unknown=36, NotChecked=0, Total=14762 [2019-09-07 09:25:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-09-07 09:25:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 551. [2019-09-07 09:25:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-07 09:25:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 686 transitions. [2019-09-07 09:25:10,795 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 686 transitions. Word has length 68 [2019-09-07 09:25:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:25:10,795 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 686 transitions. [2019-09-07 09:25:10,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 09:25:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 686 transitions. [2019-09-07 09:25:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 09:25:10,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:25:10,797 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:25:10,797 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:25:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:25:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash 391356609, now seen corresponding path program 4 times [2019-09-07 09:25:10,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:25:10,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:25:10,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:10,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:25:10,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:25:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:25:11,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:25:11,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:25:11,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:25:11,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:25:11,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:25:11,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-07 09:25:11,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:25:11,683 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 15 treesize of output 11 [2019-09-07 09:25:11,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:25:11,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:25:11,691 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-07 09:25:11,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 09:25:12,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:25:12,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 21 [2019-09-07 09:25:12,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:25:12,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:25:12,227 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-07 09:25:12,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:3 [2019-09-07 09:25:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 09:25:12,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:25:12,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 39 [2019-09-07 09:25:12,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:25:12,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:25:12,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:25:12,301 INFO L87 Difference]: Start difference. First operand 551 states and 686 transitions. Second operand 39 states. [2019-09-07 09:25:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:25:24,171 INFO L93 Difference]: Finished difference Result 854 states and 1065 transitions. [2019-09-07 09:25:24,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:25:24,172 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-09-07 09:25:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:25:24,175 INFO L225 Difference]: With dead ends: 854 [2019-09-07 09:25:24,175 INFO L226 Difference]: Without dead ends: 722 [2019-09-07 09:25:24,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=195, Invalid=1967, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:25:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-07 09:25:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 558. [2019-09-07 09:25:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-07 09:25:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 691 transitions. [2019-09-07 09:25:24,369 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 691 transitions. Word has length 72 [2019-09-07 09:25:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:25:24,370 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 691 transitions. [2019-09-07 09:25:24,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:25:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 691 transitions. [2019-09-07 09:25:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 09:25:24,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:25:24,372 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:25:24,373 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:25:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:25:24,373 INFO L82 PathProgramCache]: Analyzing trace with hash 627113359, now seen corresponding path program 5 times [2019-09-07 09:25:24,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:25:24,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:25:24,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:24,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:25:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:25:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:25:25,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:25:25,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:25:25,193 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:25:53,751 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 09:25:53,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:25:53,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 09:25:53,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:25:54,080 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 15 treesize of output 11 [2019-09-07 09:25:54,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:25:54,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:25:54,086 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-07 09:25:54,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-07 09:25:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 47 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 09:25:58,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:25:58,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-09-07 09:25:58,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 09:25:58,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 09:25:58,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=933, Unknown=2, NotChecked=0, Total=1056 [2019-09-07 09:25:58,472 INFO L87 Difference]: Start difference. First operand 558 states and 691 transitions. Second operand 33 states. [2019-09-07 09:26:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:26:26,066 INFO L93 Difference]: Finished difference Result 743 states and 922 transitions. [2019-09-07 09:26:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:26:26,066 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 72 [2019-09-07 09:26:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:26:26,069 INFO L225 Difference]: With dead ends: 743 [2019-09-07 09:26:26,069 INFO L226 Difference]: Without dead ends: 722 [2019-09-07 09:26:26,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=233, Invalid=1924, Unknown=5, NotChecked=0, Total=2162 [2019-09-07 09:26:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-07 09:26:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 567. [2019-09-07 09:26:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-07 09:26:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 699 transitions. [2019-09-07 09:26:26,185 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 699 transitions. Word has length 72 [2019-09-07 09:26:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:26:26,185 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 699 transitions. [2019-09-07 09:26:26,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 09:26:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 699 transitions. [2019-09-07 09:26:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 09:26:26,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:26:26,187 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:26:26,187 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:26:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:26:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1916544017, now seen corresponding path program 6 times [2019-09-07 09:26:26,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:26:26,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:26:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:26,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:26:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-07 09:26:26,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:26,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:26,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:26:26,663 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 09:26:26,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:26:26,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 09:26:26,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:26:26,684 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 15 treesize of output 11 [2019-09-07 09:26:26,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:26:26,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:26:26,691 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-07 09:26:26,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 09:26:27,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:26:27,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 22 [2019-09-07 09:26:27,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:26:27,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:26:27,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:26:27,148 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-07 09:26:27,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-07 09:26:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 09:26:27,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:26:27,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 30 [2019-09-07 09:26:27,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:26:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:26:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:26:27,238 INFO L87 Difference]: Start difference. First operand 567 states and 699 transitions. Second operand 30 states. [2019-09-07 09:26:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:26:34,129 INFO L93 Difference]: Finished difference Result 726 states and 901 transitions. [2019-09-07 09:26:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 09:26:34,129 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 72 [2019-09-07 09:26:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:26:34,134 INFO L225 Difference]: With dead ends: 726 [2019-09-07 09:26:34,134 INFO L226 Difference]: Without dead ends: 688 [2019-09-07 09:26:34,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=363, Invalid=3059, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:26:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-09-07 09:26:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 593. [2019-09-07 09:26:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-07 09:26:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 724 transitions. [2019-09-07 09:26:34,250 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 724 transitions. Word has length 72 [2019-09-07 09:26:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:26:34,250 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 724 transitions. [2019-09-07 09:26:34,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:26:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 724 transitions. [2019-09-07 09:26:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:26:34,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:26:34,252 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:26:34,253 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:26:34,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:26:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash 418951902, now seen corresponding path program 5 times [2019-09-07 09:26:34,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:26:34,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:26:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:34,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:26:34,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 09:26:34,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:34,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:28:43,605 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-07 09:28:43,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:43,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:28:43,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 70 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-07 09:28:43,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:43,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-09-07 09:28:43,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:28:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:28:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:28:43,934 INFO L87 Difference]: Start difference. First operand 593 states and 724 transitions. Second operand 24 states. [2019-09-07 09:28:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:45,095 INFO L93 Difference]: Finished difference Result 685 states and 837 transitions. [2019-09-07 09:28:45,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 09:28:45,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2019-09-07 09:28:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:45,099 INFO L225 Difference]: With dead ends: 685 [2019-09-07 09:28:45,099 INFO L226 Difference]: Without dead ends: 601 [2019-09-07 09:28:45,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:28:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-07 09:28:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 591. [2019-09-07 09:28:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-07 09:28:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 720 transitions. [2019-09-07 09:28:45,199 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 720 transitions. Word has length 73 [2019-09-07 09:28:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:45,200 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 720 transitions. [2019-09-07 09:28:45,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:28:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 720 transitions. [2019-09-07 09:28:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 09:28:45,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:45,201 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:45,201 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash -535714771, now seen corresponding path program 4 times [2019-09-07 09:28:45,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:45,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 09:28:45,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:45,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:28:45,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:45,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:28:45,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:45,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:28:45,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 09:28:45,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:45,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2019-09-07 09:28:45,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:28:45,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:28:45,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:28:45,732 INFO L87 Difference]: Start difference. First operand 591 states and 720 transitions. Second operand 21 states. [2019-09-07 09:28:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:47,366 INFO L93 Difference]: Finished difference Result 731 states and 885 transitions. [2019-09-07 09:28:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 09:28:47,367 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-09-07 09:28:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:47,368 INFO L225 Difference]: With dead ends: 731 [2019-09-07 09:28:47,368 INFO L226 Difference]: Without dead ends: 628 [2019-09-07 09:28:47,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=1295, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:28:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-07 09:28:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 619. [2019-09-07 09:28:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-09-07 09:28:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 749 transitions. [2019-09-07 09:28:47,484 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 749 transitions. Word has length 74 [2019-09-07 09:28:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:47,485 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 749 transitions. [2019-09-07 09:28:47,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:28:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 749 transitions. [2019-09-07 09:28:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:28:47,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:47,486 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:47,486 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1568343012, now seen corresponding path program 13 times [2019-09-07 09:28:47,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:47,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 09:28:48,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:48,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:48,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:48,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-07 09:28:48,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:48,780 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 15 treesize of output 11 [2019-09-07 09:28:48,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:28:48,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:28:48,784 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-07 09:28:48,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-09-07 09:28:49,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:28:49,200 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 34 treesize of output 26 [2019-09-07 09:28:49,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:28:49,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:28:49,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:28:49,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-09-07 09:28:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 79 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 09:28:49,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:49,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2019-09-07 09:28:49,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 09:28:49,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 09:28:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1433, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:28:49,240 INFO L87 Difference]: Start difference. First operand 619 states and 749 transitions. Second operand 40 states. [2019-09-07 09:28:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:51,112 INFO L93 Difference]: Finished difference Result 788 states and 976 transitions. [2019-09-07 09:28:51,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:28:51,113 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 73 [2019-09-07 09:28:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:51,114 INFO L225 Difference]: With dead ends: 788 [2019-09-07 09:28:51,114 INFO L226 Difference]: Without dead ends: 710 [2019-09-07 09:28:51,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=2433, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:28:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-07 09:28:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 614. [2019-09-07 09:28:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-07 09:28:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 740 transitions. [2019-09-07 09:28:51,219 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 740 transitions. Word has length 73 [2019-09-07 09:28:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:51,219 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 740 transitions. [2019-09-07 09:28:51,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 09:28:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 740 transitions. [2019-09-07 09:28:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:28:51,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:51,221 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:51,222 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -143838816, now seen corresponding path program 14 times [2019-09-07 09:28:51,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:28:52,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:52,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:52,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:28:52,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:28:52,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:52,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-07 09:28:52,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:52,646 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 15 treesize of output 11 [2019-09-07 09:28:52,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:28:52,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:28:52,654 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-07 09:28:52,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 09:28:53,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:28:53,159 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:28:53,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:28:53,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:28:53,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:28:53,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:28:53,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 27 [2019-09-07 09:28:53,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:28:53,177 INFO L567 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-09-07 09:28:53,177 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-07 09:28:53,177 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:4 [2019-09-07 09:28:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 95 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 09:28:53,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:53,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 41 [2019-09-07 09:28:53,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 09:28:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 09:28:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:28:53,235 INFO L87 Difference]: Start difference. First operand 614 states and 740 transitions. Second operand 41 states. [2019-09-07 09:28:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:54,912 INFO L93 Difference]: Finished difference Result 817 states and 994 transitions. [2019-09-07 09:28:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 09:28:54,913 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 73 [2019-09-07 09:28:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:54,914 INFO L225 Difference]: With dead ends: 817 [2019-09-07 09:28:54,914 INFO L226 Difference]: Without dead ends: 673 [2019-09-07 09:28:54,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:28:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-07 09:28:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 623. [2019-09-07 09:28:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-07 09:28:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 750 transitions. [2019-09-07 09:28:55,032 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 750 transitions. Word has length 73 [2019-09-07 09:28:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:55,033 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 750 transitions. [2019-09-07 09:28:55,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 09:28:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 750 transitions. [2019-09-07 09:28:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:28:55,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:55,034 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:55,034 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:55,034 INFO L82 PathProgramCache]: Analyzing trace with hash -456551630, now seen corresponding path program 15 times [2019-09-07 09:28:55,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:55,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:55,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:55,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:28:56,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:56,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:29:10,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 09:29:10,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:10,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-07 09:29:10,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:10,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:29:10,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:10,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:10,990 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-07 09:29:10,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 09:29:11,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:29:11,606 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:29:11,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:11,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:29:11,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:29:11,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:11,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 27 [2019-09-07 09:29:11,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:11,643 INFO L567 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-09-07 09:29:11,643 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-07 09:29:11,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:4 [2019-09-07 09:29:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:29:11,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:11,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 44 [2019-09-07 09:29:11,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 09:29:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 09:29:11,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:29:11,709 INFO L87 Difference]: Start difference. First operand 623 states and 750 transitions. Second operand 44 states. [2019-09-07 09:29:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:13,990 INFO L93 Difference]: Finished difference Result 1037 states and 1262 transitions. [2019-09-07 09:29:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:29:13,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2019-09-07 09:29:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:13,992 INFO L225 Difference]: With dead ends: 1037 [2019-09-07 09:29:13,992 INFO L226 Difference]: Without dead ends: 994 [2019-09-07 09:29:13,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=194, Invalid=2458, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:29:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-09-07 09:29:14,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 632. [2019-09-07 09:29:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-07 09:29:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 760 transitions. [2019-09-07 09:29:14,101 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 760 transitions. Word has length 73 [2019-09-07 09:29:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:14,101 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 760 transitions. [2019-09-07 09:29:14,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 09:29:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 760 transitions. [2019-09-07 09:29:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:29:14,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:14,103 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:14,103 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash -699928480, now seen corresponding path program 16 times [2019-09-07 09:29:14,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:14,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:14,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:29:15,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:15,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:29:15,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:29:15,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:15,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-07 09:29:15,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:15,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:29:15,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:15,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:16,000 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-07 09:29:16,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 09:29:16,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:29:16,668 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:29:16,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:16,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:29:16,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:29:16,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:16,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 27 [2019-09-07 09:29:16,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:16,689 INFO L567 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-09-07 09:29:16,689 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-07 09:29:16,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:4 [2019-09-07 09:29:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 99 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:29:16,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:16,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 45 [2019-09-07 09:29:16,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 09:29:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 09:29:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 09:29:16,742 INFO L87 Difference]: Start difference. First operand 632 states and 760 transitions. Second operand 45 states. [2019-09-07 09:29:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:19,759 INFO L93 Difference]: Finished difference Result 1046 states and 1273 transitions. [2019-09-07 09:29:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:29:19,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 73 [2019-09-07 09:29:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:19,761 INFO L225 Difference]: With dead ends: 1046 [2019-09-07 09:29:19,761 INFO L226 Difference]: Without dead ends: 1003 [2019-09-07 09:29:19,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:29:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-07 09:29:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 641. [2019-09-07 09:29:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-07 09:29:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 770 transitions. [2019-09-07 09:29:19,874 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 770 transitions. Word has length 73 [2019-09-07 09:29:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:19,874 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 770 transitions. [2019-09-07 09:29:19,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 09:29:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 770 transitions. [2019-09-07 09:29:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:29:19,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:19,876 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:19,876 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1234871182, now seen corresponding path program 17 times [2019-09-07 09:29:19,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:19,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:19,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:19,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:29:21,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:21,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:21,687 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:01,895 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 09:30:01,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:02,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-07 09:30:02,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:02,231 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 15 treesize of output 11 [2019-09-07 09:30:02,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:30:02,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:30:02,245 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-07 09:30:02,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-07 09:30:02,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 09:30:02,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:30:02,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:30:02,297 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-07 09:30:02,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 09:30:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:30:03,318 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 09:30:03,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:30:03,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:30:03,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 09:30:03,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 09:30:03,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:30:03,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 29 [2019-09-07 09:30:03,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 09:30:03,337 INFO L567 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-09-07 09:30:03,338 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-07 09:30:03,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:4 [2019-09-07 09:30:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:30:03,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:03,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 45 [2019-09-07 09:30:03,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 09:30:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 09:30:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 09:30:03,396 INFO L87 Difference]: Start difference. First operand 641 states and 770 transitions. Second operand 45 states. [2019-09-07 09:30:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:06,242 INFO L93 Difference]: Finished difference Result 1055 states and 1284 transitions. [2019-09-07 09:30:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:30:06,242 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 73 [2019-09-07 09:30:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:06,244 INFO L225 Difference]: With dead ends: 1055 [2019-09-07 09:30:06,244 INFO L226 Difference]: Without dead ends: 1012 [2019-09-07 09:30:06,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=199, Invalid=2557, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:30:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-09-07 09:30:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 652. [2019-09-07 09:30:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-07 09:30:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 783 transitions. [2019-09-07 09:30:06,375 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 783 transitions. Word has length 73 [2019-09-07 09:30:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:06,375 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 783 transitions. [2019-09-07 09:30:06,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 09:30:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 783 transitions. [2019-09-07 09:30:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 09:30:06,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:06,377 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:06,377 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2006364207, now seen corresponding path program 5 times [2019-09-07 09:30:06,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:06,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:06,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-07 09:30:06,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:06,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:06,726 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1