java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:10:29,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:10:29,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:10:29,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:10:29,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:10:29,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:10:29,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:10:29,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:10:29,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:10:29,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:10:29,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:10:29,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:10:29,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:10:29,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:10:29,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:10:29,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:10:29,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:10:29,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:10:29,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:10:29,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:10:29,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:10:29,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:10:29,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:10:29,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:10:29,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:10:29,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:10:29,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:10:29,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:10:29,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:10:29,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:10:29,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:10:29,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:10:29,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:10:29,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:10:29,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:10:29,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:10:29,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:10:29,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:10:29,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:10:29,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:10:29,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:10:29,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:10:29,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:10:29,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:10:29,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:10:29,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:10:29,519 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:10:29,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:10:29,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:10:29,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:10:29,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:10:29,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:10:29,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:10:29,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:10:29,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:10:29,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:10:29,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:10:29,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:10:29,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:10:29,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:10:29,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:10:29,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:10:29,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:10:29,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:29,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:10:29,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:10:29,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:10:29,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:10:29,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:10:29,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:10:29,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:10:29,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:10:29,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:10:29,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:10:29,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:10:29,811 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:10:29,811 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag.i [2019-10-14 23:10:29,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c469f5df6/f80d2962a76c44e1bd76d5a8426f932d/FLAG3e2692877 [2019-10-14 23:10:30,326 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:10:30,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_flag.i [2019-10-14 23:10:30,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c469f5df6/f80d2962a76c44e1bd76d5a8426f932d/FLAG3e2692877 [2019-10-14 23:10:30,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c469f5df6/f80d2962a76c44e1bd76d5a8426f932d [2019-10-14 23:10:30,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:10:30,372 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:10:30,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:30,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:10:30,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:10:30,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:30,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e07cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30, skipping insertion in model container [2019-10-14 23:10:30,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:30,388 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:10:30,423 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:10:30,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:30,860 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:10:30,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:30,965 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:10:30,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30 WrapperNode [2019-10-14 23:10:30,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:30,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:10:30,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:10:30,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:10:30,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:30,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:31,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:31,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:31,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:31,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:31,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... [2019-10-14 23:10:31,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:10:31,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:10:31,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:10:31,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:10:31,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:10:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:10:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:10:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:10:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-14 23:10:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-14 23:10:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-14 23:10:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:10:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:10:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:10:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:10:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:10:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:10:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:10:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:10:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:10:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:10:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:10:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:10:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:10:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:10:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:10:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:10:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:10:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:10:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:10:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:10:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:10:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:10:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-14 23:10:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-14 23:10:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-14 23:10:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:10:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:10:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:10:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:10:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:10:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:10:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:10:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:10:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:10:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:10:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:10:31,116 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:10:31,116 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:10:31,116 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:10:31,116 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:10:31,116 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:10:31,116 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:10:31,116 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:10:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:10:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:10:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:10:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:10:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:10:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:10:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:10:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:10:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:10:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:10:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:10:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:10:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:10:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:10:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:10:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:10:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:10:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:10:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:10:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:10:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:10:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:10:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:10:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:10:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:10:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:10:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:10:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:10:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:10:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:10:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:10:31,122 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:10:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:10:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:10:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:10:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:10:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:10:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:10:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:10:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:10:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:10:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:10:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:10:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:10:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:10:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:10:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:10:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:10:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:10:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:10:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:10:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:10:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:10:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:10:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:10:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:10:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:10:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:10:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:10:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:10:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:10:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:10:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:10:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:10:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:10:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:10:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:10:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:10:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:10:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:10:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:10:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:10:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:10:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:10:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:10:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:10:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:10:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:10:31,595 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:10:31,795 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:10:31,795 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:10:31,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:31 BoogieIcfgContainer [2019-10-14 23:10:31,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:10:31,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:10:31,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:10:31,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:10:31,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:10:30" (1/3) ... [2019-10-14 23:10:31,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f06b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:31, skipping insertion in model container [2019-10-14 23:10:31,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:30" (2/3) ... [2019-10-14 23:10:31,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f06b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:31, skipping insertion in model container [2019-10-14 23:10:31,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:31" (3/3) ... [2019-10-14 23:10:31,805 INFO L109 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2019-10-14 23:10:31,814 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:10:31,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:10:31,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:10:31,855 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:10:31,855 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:10:31,855 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:10:31,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:10:31,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:10:31,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:10:31,856 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:10:31,856 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:10:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-14 23:10:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:10:31,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:31,881 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:31,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -10426518, now seen corresponding path program 1 times [2019-10-14 23:10:31,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:31,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842343866] [2019-10-14 23:10:31,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:31,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:32,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842343866] [2019-10-14 23:10:32,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:32,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:10:32,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41548039] [2019-10-14 23:10:32,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:10:32,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:32,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:10:32,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:32,105 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-10-14 23:10:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:32,218 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2019-10-14 23:10:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:10:32,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 23:10:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:32,234 INFO L225 Difference]: With dead ends: 55 [2019-10-14 23:10:32,235 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 23:10:32,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 23:10:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-14 23:10:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 23:10:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-14 23:10:32,305 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2019-10-14 23:10:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:32,305 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-14 23:10:32,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:10:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-14 23:10:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:10:32,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:32,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:32,307 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:32,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:32,308 INFO L82 PathProgramCache]: Analyzing trace with hash -166897896, now seen corresponding path program 1 times [2019-10-14 23:10:32,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:32,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023827192] [2019-10-14 23:10:32,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:32,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:32,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:32,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023827192] [2019-10-14 23:10:32,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:32,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:10:32,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940445152] [2019-10-14 23:10:32,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:10:32,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:10:32,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:32,623 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 8 states. [2019-10-14 23:10:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:32,746 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-10-14 23:10:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:10:32,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-14 23:10:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:32,748 INFO L225 Difference]: With dead ends: 42 [2019-10-14 23:10:32,748 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:10:32,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:10:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:10:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-10-14 23:10:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 23:10:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-10-14 23:10:32,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2019-10-14 23:10:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:32,756 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-10-14 23:10:32,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:10:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-10-14 23:10:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:10:32,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:32,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:32,758 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash -166856170, now seen corresponding path program 1 times [2019-10-14 23:10:32,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:32,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672032911] [2019-10-14 23:10:32,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:32,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:32,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:32,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672032911] [2019-10-14 23:10:32,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:32,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:32,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2706269] [2019-10-14 23:10:32,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:32,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:32,877 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 6 states. [2019-10-14 23:10:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:33,024 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2019-10-14 23:10:33,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:33,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 23:10:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:33,026 INFO L225 Difference]: With dead ends: 60 [2019-10-14 23:10:33,027 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 23:10:33,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 23:10:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-10-14 23:10:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:10:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-10-14 23:10:33,039 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2019-10-14 23:10:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:33,040 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-14 23:10:33,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-10-14 23:10:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:10:33,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:33,041 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:33,041 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1985042728, now seen corresponding path program 1 times [2019-10-14 23:10:33,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:33,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734985409] [2019-10-14 23:10:33,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:33,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:33,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:33,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734985409] [2019-10-14 23:10:33,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855405116] [2019-10-14 23:10:33,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:33,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-14 23:10:33,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:33,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:33,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:33,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:33,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:33,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:33,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 23:10:33,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:33,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:33,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:33,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-14 23:10:33,529 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:33,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:33,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:33,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-14 23:10:33,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:33,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:33,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:33,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-14 23:10:33,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:33,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:33,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:33,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:33,655 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:33,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-14 23:10:33,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980705423] [2019-10-14 23:10:33,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:10:33,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:10:33,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:33,659 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2019-10-14 23:10:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:34,063 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-10-14 23:10:34,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:10:34,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-14 23:10:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:34,071 INFO L225 Difference]: With dead ends: 80 [2019-10-14 23:10:34,071 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 23:10:34,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:10:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 23:10:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2019-10-14 23:10:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 23:10:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2019-10-14 23:10:34,090 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 24 [2019-10-14 23:10:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:34,091 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2019-10-14 23:10:34,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:10:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2019-10-14 23:10:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:10:34,093 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:34,093 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:34,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:34,302 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1985035784, now seen corresponding path program 1 times [2019-10-14 23:10:34,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:34,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842859183] [2019-10-14 23:10:34,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:34,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842859183] [2019-10-14 23:10:34,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559512286] [2019-10-14 23:10:34,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 23:10:34,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:34,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:34,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:34,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:34,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-10-14 23:10:34,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:34,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-10-14 23:10:34,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 23:10:34,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:34,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-10-14 23:10:34,872 INFO L341 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2019-10-14 23:10:34,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2019-10-14 23:10:34,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-10-14 23:10:34,930 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-14 23:10:34,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2019-10-14 23:10:34,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:34,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2019-10-14 23:10:34,980 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-14 23:10:34,980 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 1 case distinctions, treesize of input 34 treesize of output 14 [2019-10-14 23:10:34,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:34,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:34,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:4 [2019-10-14 23:10:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:34,992 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:34,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-14 23:10:34,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278809976] [2019-10-14 23:10:34,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 23:10:34,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:34,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 23:10:34,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:10:34,994 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 18 states. [2019-10-14 23:10:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:35,595 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2019-10-14 23:10:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:10:35,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-14 23:10:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:35,597 INFO L225 Difference]: With dead ends: 108 [2019-10-14 23:10:35,597 INFO L226 Difference]: Without dead ends: 98 [2019-10-14 23:10:35,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:10:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-14 23:10:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2019-10-14 23:10:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 23:10:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2019-10-14 23:10:35,609 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 24 [2019-10-14 23:10:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:35,609 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2019-10-14 23:10:35,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 23:10:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2019-10-14 23:10:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:10:35,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:35,611 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:35,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:35,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:35,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:35,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1500536216, now seen corresponding path program 1 times [2019-10-14 23:10:35,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:35,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217383918] [2019-10-14 23:10:35,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:35,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:35,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:35,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217383918] [2019-10-14 23:10:35,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612515608] [2019-10-14 23:10:35,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:10:36,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:36,053 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:36,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-14 23:10:36,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444905217] [2019-10-14 23:10:36,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:10:36,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:10:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:36,054 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand 12 states. [2019-10-14 23:10:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:36,336 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2019-10-14 23:10:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:10:36,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-14 23:10:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:36,338 INFO L225 Difference]: With dead ends: 151 [2019-10-14 23:10:36,338 INFO L226 Difference]: Without dead ends: 93 [2019-10-14 23:10:36,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:10:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-14 23:10:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-10-14 23:10:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 23:10:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-10-14 23:10:36,349 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 24 [2019-10-14 23:10:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:36,349 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-10-14 23:10:36,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:10:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2019-10-14 23:10:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:10:36,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:36,350 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:36,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:36,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1723118554, now seen corresponding path program 1 times [2019-10-14 23:10:36,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:36,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066719099] [2019-10-14 23:10:36,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:36,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066719099] [2019-10-14 23:10:36,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236800361] [2019-10-14 23:10:36,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 23:10:36,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:36,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:36,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:36,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:36,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-10-14 23:10:36,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:36,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:10:36,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-10-14 23:10:36,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:36,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-10-14 23:10:37,085 INFO L341 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2019-10-14 23:10:37,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2019-10-14 23:10:37,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2019-10-14 23:10:37,123 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-14 23:10:37,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-10-14 23:10:37,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:37,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-10-14 23:10:37,184 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-14 23:10:37,184 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 1 case distinctions, treesize of input 33 treesize of output 13 [2019-10-14 23:10:37,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-10-14 23:10:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:37,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:37,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-14 23:10:37,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755413618] [2019-10-14 23:10:37,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 23:10:37,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 23:10:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:10:37,203 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 18 states. [2019-10-14 23:10:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,699 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2019-10-14 23:10:37,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:10:37,700 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-14 23:10:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,701 INFO L225 Difference]: With dead ends: 117 [2019-10-14 23:10:37,701 INFO L226 Difference]: Without dead ends: 97 [2019-10-14 23:10:37,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:10:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-14 23:10:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2019-10-14 23:10:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-14 23:10:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2019-10-14 23:10:37,711 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 24 [2019-10-14 23:10:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,711 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2019-10-14 23:10:37,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 23:10:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2019-10-14 23:10:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:10:37,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,713 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:37,921 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1723125498, now seen corresponding path program 1 times [2019-10-14 23:10:37,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908608716] [2019-10-14 23:10:37,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:38,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908608716] [2019-10-14 23:10:38,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799028987] [2019-10-14 23:10:38,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-14 23:10:38,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:38,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:38,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:38,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:38,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 23:10:38,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:38,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-14 23:10:38,220 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:38,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:38,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-14 23:10:38,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:38,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:38,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-14 23:10:38,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:38,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:38,305 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:38,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-14 23:10:38,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038295160] [2019-10-14 23:10:38,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:10:38,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:38,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:10:38,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:38,307 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 12 states. [2019-10-14 23:10:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:38,686 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2019-10-14 23:10:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:10:38,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-14 23:10:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:38,688 INFO L225 Difference]: With dead ends: 106 [2019-10-14 23:10:38,689 INFO L226 Difference]: Without dead ends: 104 [2019-10-14 23:10:38,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:10:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-14 23:10:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 80. [2019-10-14 23:10:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-14 23:10:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2019-10-14 23:10:38,698 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 24 [2019-10-14 23:10:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:38,698 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2019-10-14 23:10:38,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:10:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2019-10-14 23:10:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:10:38,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:38,700 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:38,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,904 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1282584101, now seen corresponding path program 1 times [2019-10-14 23:10:38,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:38,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540817208] [2019-10-14 23:10:38,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:39,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540817208] [2019-10-14 23:10:39,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026664609] [2019-10-14 23:10:39,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-14 23:10:39,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:39,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:39,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:39,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:39,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-14 23:10:39,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:39,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:39,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,273 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-10-14 23:10:39,298 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_$Pointer$.offset_17|, |v_#memory_$Pointer$.base_21|]} [2019-10-14 23:10:39,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-10-14 23:10:39,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2019-10-14 23:10:39,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2019-10-14 23:10:39,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:39,358 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,374 INFO L567 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2019-10-14 23:10:39,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,375 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-10-14 23:10:39,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-10-14 23:10:39,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-14 23:10:39,414 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-10-14 23:10:39,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:39,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:10:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:39,429 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:39,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-10-14 23:10:39,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380587378] [2019-10-14 23:10:39,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:10:39,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:10:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:10:39,430 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 15 states. [2019-10-14 23:10:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:39,815 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2019-10-14 23:10:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:10:39,815 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-14 23:10:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:39,816 INFO L225 Difference]: With dead ends: 106 [2019-10-14 23:10:39,818 INFO L226 Difference]: Without dead ends: 77 [2019-10-14 23:10:39,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:10:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-14 23:10:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2019-10-14 23:10:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-14 23:10:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2019-10-14 23:10:39,830 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 29 [2019-10-14 23:10:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:39,836 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2019-10-14 23:10:39,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:10:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2019-10-14 23:10:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:10:39,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:39,838 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:40,043 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1529316394, now seen corresponding path program 2 times [2019-10-14 23:10:40,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552189338] [2019-10-14 23:10:40,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:40,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552189338] [2019-10-14 23:10:40,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128509958] [2019-10-14 23:10:40,288 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:40,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:40,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:40,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-14 23:10:40,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:40,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:40,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:40,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:40,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:10:40,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:40,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,513 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-14 23:10:40,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-14 23:10:40,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:40,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:40,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:40,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:10:40,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-10-14 23:10:40,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:40,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 23:10:40,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:10:40,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-10-14 23:10:40,723 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:40,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:10:40,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:40,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-14 23:10:40,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:10:40,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,784 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-10-14 23:10:40,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-10-14 23:10:40,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:10:40,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-10-14 23:10:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:40,860 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:40,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2019-10-14 23:10:40,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551634091] [2019-10-14 23:10:40,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 23:10:40,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:40,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 23:10:40,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:10:40,862 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 20 states. [2019-10-14 23:10:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:41,656 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2019-10-14 23:10:41,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:10:41,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-10-14 23:10:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:41,657 INFO L225 Difference]: With dead ends: 136 [2019-10-14 23:10:41,658 INFO L226 Difference]: Without dead ends: 134 [2019-10-14 23:10:41,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:10:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-14 23:10:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 93. [2019-10-14 23:10:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-14 23:10:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2019-10-14 23:10:41,667 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2019-10-14 23:10:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:41,667 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2019-10-14 23:10:41,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 23:10:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2019-10-14 23:10:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:10:41,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:41,669 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:41,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:41,881 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1948002452, now seen corresponding path program 1 times [2019-10-14 23:10:41,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:41,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025775027] [2019-10-14 23:10:41,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:41,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:41,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:42,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025775027] [2019-10-14 23:10:42,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807441362] [2019-10-14 23:10:42,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-14 23:10:42,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:42,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:42,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:42,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:42,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2019-10-14 23:10:42,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-10-14 23:10:42,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:42,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:42,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:42,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-10-14 23:10:42,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,324 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,355 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2019-10-14 23:10:42,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:42,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-10-14 23:10:42,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-10-14 23:10:42,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-10-14 23:10:42,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-14 23:10:42,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2019-10-14 23:10:42,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:10:42,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 23:10:42,599 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:42,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-10-14 23:10:42,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:32 [2019-10-14 23:10:42,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 78 [2019-10-14 23:10:42,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,724 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.2 percent of original size [2019-10-14 23:10:42,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:48 [2019-10-14 23:10:42,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-14 23:10:42,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:3 [2019-10-14 23:10:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:42,919 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:42,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2019-10-14 23:10:42,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838184751] [2019-10-14 23:10:42,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 23:10:42,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:42,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 23:10:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:10:42,921 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 22 states. [2019-10-14 23:10:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:43,859 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2019-10-14 23:10:43,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:10:43,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-14 23:10:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:43,860 INFO L225 Difference]: With dead ends: 142 [2019-10-14 23:10:43,860 INFO L226 Difference]: Without dead ends: 128 [2019-10-14 23:10:43,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1022, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 23:10:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-14 23:10:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 98. [2019-10-14 23:10:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-14 23:10:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2019-10-14 23:10:43,877 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 31 [2019-10-14 23:10:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:43,877 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2019-10-14 23:10:43,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 23:10:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2019-10-14 23:10:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:10:43,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:43,879 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:44,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:44,092 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:44,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1948009396, now seen corresponding path program 1 times [2019-10-14 23:10:44,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:44,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520352550] [2019-10-14 23:10:44,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:44,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:44,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:44,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520352550] [2019-10-14 23:10:44,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070270943] [2019-10-14 23:10:44,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:44,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-14 23:10:44,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:44,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:44,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:44,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:44,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:10:44,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:44,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-10-14 23:10:44,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:44,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:44,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-14 23:10:44,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:10:44,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2019-10-14 23:10:44,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:44,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:10:44,566 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:44,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:10:44,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:44,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-10-14 23:10:44,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,676 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-10-14 23:10:44,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-10-14 23:10:44,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:44,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:44,859 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:44,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2019-10-14 23:10:44,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665078234] [2019-10-14 23:10:44,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 23:10:44,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 23:10:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:10:44,861 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 20 states. [2019-10-14 23:10:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:45,808 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2019-10-14 23:10:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-14 23:10:45,809 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-10-14 23:10:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:45,811 INFO L225 Difference]: With dead ends: 143 [2019-10-14 23:10:45,811 INFO L226 Difference]: Without dead ends: 141 [2019-10-14 23:10:45,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1077, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 23:10:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-14 23:10:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2019-10-14 23:10:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-14 23:10:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-10-14 23:10:45,819 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 31 [2019-10-14 23:10:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:45,820 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-10-14 23:10:45,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 23:10:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-10-14 23:10:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:10:45,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:45,821 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:46,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:46,026 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:46,027 INFO L82 PathProgramCache]: Analyzing trace with hash 935086055, now seen corresponding path program 2 times [2019-10-14 23:10:46,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:46,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507474751] [2019-10-14 23:10:46,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:46,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:46,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:46,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507474751] [2019-10-14 23:10:46,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949560313] [2019-10-14 23:10:46,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:46,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:46,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:46,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-14 23:10:46,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:46,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:46,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:46,566 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:46,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,593 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-14 23:10:46,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-14 23:10:46,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:46,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:46,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-10-14 23:10:46,723 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-10-14 23:10:46,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-10-14 23:10:46,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,756 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-10-14 23:10:46,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:46,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:32 [2019-10-14 23:10:46,800 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_52|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_22|]} [2019-10-14 23:10:46,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:46,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,845 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 23:10:46,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2019-10-14 23:10:46,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,899 INFO L567 ElimStorePlain]: treesize reduction 8, result has 87.1 percent of original size [2019-10-14 23:10:46,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-14 23:10:46,903 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,918 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:39 [2019-10-14 23:10:46,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:10:46,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2019-10-14 23:10:47,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 136 [2019-10-14 23:10:47,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:47,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:10:47,122 INFO L567 ElimStorePlain]: treesize reduction 141, result has 49.5 percent of original size [2019-10-14 23:10:47,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 108 [2019-10-14 23:10:47,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:47,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-10-14 23:10:47,159 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,177 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2019-10-14 23:10:47,216 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_24|, |v_#memory_int_54|], 6=[|v_#memory_$Pointer$.base_30|]} [2019-10-14 23:10:47,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 199 [2019-10-14 23:10:47,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:47,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-14 23:10:47,307 INFO L567 ElimStorePlain]: treesize reduction 334, result has 32.9 percent of original size [2019-10-14 23:10:47,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 137 [2019-10-14 23:10:47,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2019-10-14 23:10:47,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,405 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,441 INFO L567 ElimStorePlain]: treesize reduction 134, result has 39.6 percent of original size [2019-10-14 23:10:47,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:47,442 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2019-10-14 23:10:47,494 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-10-14 23:10:47,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2019-10-14 23:10:47,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 47 [2019-10-14 23:10:47,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,521 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:47,540 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:47,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:47,541 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2019-10-14 23:10:47,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:47,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:47,594 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:47,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2019-10-14 23:10:47,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625715393] [2019-10-14 23:10:47,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 23:10:47,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:47,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 23:10:47,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:10:47,596 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 22 states. [2019-10-14 23:10:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:48,662 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2019-10-14 23:10:48,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:10:48,663 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-10-14 23:10:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:48,665 INFO L225 Difference]: With dead ends: 147 [2019-10-14 23:10:48,665 INFO L226 Difference]: Without dead ends: 145 [2019-10-14 23:10:48,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:10:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-14 23:10:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2019-10-14 23:10:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-14 23:10:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2019-10-14 23:10:48,680 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 36 [2019-10-14 23:10:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:48,681 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2019-10-14 23:10:48,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 23:10:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2019-10-14 23:10:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:10:48,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:48,683 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:10:48,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:48,899 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash 935092999, now seen corresponding path program 1 times [2019-10-14 23:10:48,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:48,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122719040] [2019-10-14 23:10:48,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:49,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122719040] [2019-10-14 23:10:49,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388406293] [2019-10-14 23:10:49,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-14 23:10:49,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:49,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:49,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:49,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:49,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-14 23:10:49,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:49,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:49,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-14 23:10:49,650 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_32|]} [2019-10-14 23:10:49,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:49,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2019-10-14 23:10:49,697 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-10-14 23:10:49,721 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,736 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:93, output treesize:42 [2019-10-14 23:10:49,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-10-14 23:10:49,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-10-14 23:10:49,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-10-14 23:10:49,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,879 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:46 [2019-10-14 23:10:49,996 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_28|], 6=[|v_#memory_int_57|]} [2019-10-14 23:10:49,999 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:10:50,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 126 [2019-10-14 23:10:50,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,062 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.4 percent of original size [2019-10-14 23:10:50,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 109 [2019-10-14 23:10:50,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:50,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:50,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:50,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 40 [2019-10-14 23:10:50,097 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,115 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:86 [2019-10-14 23:10:50,161 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|], 6=[|v_#memory_$Pointer$.offset_29|, |v_#memory_int_58|]} [2019-10-14 23:10:50,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 178 [2019-10-14 23:10:50,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:50,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:50,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,187 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:50,249 INFO L567 ElimStorePlain]: treesize reduction 58, result has 66.7 percent of original size [2019-10-14 23:10:50,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 124 [2019-10-14 23:10:50,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 45 [2019-10-14 23:10:50,323 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,359 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.1 percent of original size [2019-10-14 23:10:50,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:50,361 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:180, output treesize:68 [2019-10-14 23:10:50,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,713 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, v_prenex_4], 1=[|#memory_$Pointer$.offset|, v_prenex_5]} [2019-10-14 23:10:50,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2019-10-14 23:10:50,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-10-14 23:10:50,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2019-10-14 23:10:50,788 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:50,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2019-10-14 23:10:50,816 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-14 23:10:50,841 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:142, output treesize:64 [2019-10-14 23:10:50,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 37 [2019-10-14 23:10:50,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:4 [2019-10-14 23:10:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:50,985 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:50,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-10-14 23:10:50,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015767556] [2019-10-14 23:10:50,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 23:10:50,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 23:10:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:10:50,986 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand 27 states. [2019-10-14 23:10:51,737 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-14 23:10:52,226 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-10-14 23:10:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:52,558 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2019-10-14 23:10:52,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:10:52,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-10-14 23:10:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:52,560 INFO L225 Difference]: With dead ends: 145 [2019-10-14 23:10:52,560 INFO L226 Difference]: Without dead ends: 135 [2019-10-14 23:10:52,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2019-10-14 23:10:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-14 23:10:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2019-10-14 23:10:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-14 23:10:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2019-10-14 23:10:52,570 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 36 [2019-10-14 23:10:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:52,570 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2019-10-14 23:10:52,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-14 23:10:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2019-10-14 23:10:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:10:52,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:52,571 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:10:52,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:52,776 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1059058651, now seen corresponding path program 1 times [2019-10-14 23:10:52,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:52,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459973865] [2019-10-14 23:10:52,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:53,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459973865] [2019-10-14 23:10:53,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496528458] [2019-10-14 23:10:53,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:53,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-14 23:10:53,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:53,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:53,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:53,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:53,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-14 23:10:53,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:53,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:53,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-14 23:10:53,608 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_31|]} [2019-10-14 23:10:53,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:53,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:53,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-10-14 23:10:53,640 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:53,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2019-10-14 23:10:53,664 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,688 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:93, output treesize:42 [2019-10-14 23:10:53,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:53,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:10:53,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:53,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-10-14 23:10:53,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-10-14 23:10:53,789 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,804 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:41 [2019-10-14 23:10:53,879 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_33|], 6=[|v_#memory_int_61|]} [2019-10-14 23:10:53,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:10:53,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 125 [2019-10-14 23:10:53,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,967 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.3 percent of original size [2019-10-14 23:10:53,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 108 [2019-10-14 23:10:53,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:53,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:53,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:53,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 39 [2019-10-14 23:10:53,999 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,017 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:157, output treesize:85 [2019-10-14 23:10:54,057 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_40|], 6=[|v_#memory_$Pointer$.offset_34|, |v_#memory_int_62|]} [2019-10-14 23:10:54,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 177 [2019-10-14 23:10:54,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:54,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:54,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,083 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:54,141 INFO L567 ElimStorePlain]: treesize reduction 58, result has 66.5 percent of original size [2019-10-14 23:10:54,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 123 [2019-10-14 23:10:54,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 44 [2019-10-14 23:10:54,211 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,250 INFO L567 ElimStorePlain]: treesize reduction 12, result has 81.8 percent of original size [2019-10-14 23:10:54,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:54,251 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:179, output treesize:67 [2019-10-14 23:10:54,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,566 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, v_prenex_6], 1=[|#memory_$Pointer$.offset|, v_prenex_7]} [2019-10-14 23:10:54,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-10-14 23:10:54,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2019-10-14 23:10:54,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:54,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-10-14 23:10:54,658 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:54,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2019-10-14 23:10:54,686 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-14 23:10:54,705 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:132, output treesize:58 [2019-10-14 23:10:54,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 44 [2019-10-14 23:10:54,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:3 [2019-10-14 23:10:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:54,929 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:54,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-10-14 23:10:54,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271706405] [2019-10-14 23:10:54,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 23:10:54,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:54,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 23:10:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:10:54,932 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 27 states. [2019-10-14 23:10:55,765 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-14 23:10:56,254 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-14 23:10:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:56,585 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-10-14 23:10:56,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:10:56,585 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-10-14 23:10:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:56,586 INFO L225 Difference]: With dead ends: 155 [2019-10-14 23:10:56,586 INFO L226 Difference]: Without dead ends: 145 [2019-10-14 23:10:56,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2019-10-14 23:10:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-14 23:10:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2019-10-14 23:10:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-14 23:10:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-10-14 23:10:56,604 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 36 [2019-10-14 23:10:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:56,604 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-10-14 23:10:56,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-14 23:10:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-10-14 23:10:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:10:56,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:56,605 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:10:56,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:56,817 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1059051707, now seen corresponding path program 1 times [2019-10-14 23:10:56,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:56,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271703597] [2019-10-14 23:10:56,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:56,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:56,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:57,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271703597] [2019-10-14 23:10:57,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196664431] [2019-10-14 23:10:57,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:57,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 23:10:57,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:57,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:57,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:57,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:57,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-14 23:10:57,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:57,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:57,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-14 23:10:57,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2019-10-14 23:10:57,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-10-14 23:10:57,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:29 [2019-10-14 23:10:57,393 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 2=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_43|]} [2019-10-14 23:10:57,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:57,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-10-14 23:10:57,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-10-14 23:10:57,444 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,456 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:32 [2019-10-14 23:10:57,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 103 [2019-10-14 23:10:57,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 74 [2019-10-14 23:10:57,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,602 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.9 percent of original size [2019-10-14 23:10:57,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-10-14 23:10:57,606 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,652 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:140, output treesize:52 [2019-10-14 23:10:57,706 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_45|, |v_#memory_int_65|], 5=[|v_#memory_$Pointer$.offset_39|]} [2019-10-14 23:10:57,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 118 [2019-10-14 23:10:57,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:57,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:57,729 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,774 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-10-14 23:10:57,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2019-10-14 23:10:57,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,835 INFO L567 ElimStorePlain]: treesize reduction 12, result has 86.0 percent of original size [2019-10-14 23:10:57,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 98 [2019-10-14 23:10:57,874 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,891 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:122, output treesize:56 [2019-10-14 23:10:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,295 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_9, |#memory_$Pointer$.base|], 1=[|#memory_$Pointer$.offset|, v_prenex_11]} [2019-10-14 23:10:58,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2019-10-14 23:10:58,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2019-10-14 23:10:58,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:58,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2019-10-14 23:10:58,367 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:58,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-10-14 23:10:58,392 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-14 23:10:58,410 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:110, output treesize:44 [2019-10-14 23:10:58,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,617 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 29 treesize of output 37 [2019-10-14 23:10:58,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,631 INFO L567 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-10-14 23:10:58,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-10-14 23:10:58,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-14 23:10:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:58,639 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:58,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2019-10-14 23:10:58,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599914678] [2019-10-14 23:10:58,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 23:10:58,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:58,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 23:10:58,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2019-10-14 23:10:58,640 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 26 states. [2019-10-14 23:11:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:00,584 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2019-10-14 23:11:00,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-14 23:11:00,584 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-10-14 23:11:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:00,586 INFO L225 Difference]: With dead ends: 166 [2019-10-14 23:11:00,586 INFO L226 Difference]: Without dead ends: 164 [2019-10-14 23:11:00,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2019-10-14 23:11:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-14 23:11:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2019-10-14 23:11:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-14 23:11:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2019-10-14 23:11:00,597 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 36 [2019-10-14 23:11:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:00,597 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2019-10-14 23:11:00,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 23:11:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2019-10-14 23:11:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:00,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:00,598 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:00,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:00,802 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash -467482568, now seen corresponding path program 2 times [2019-10-14 23:11:00,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:00,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971527484] [2019-10-14 23:11:00,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:00,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:00,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:01,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971527484] [2019-10-14 23:11:01,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312864569] [2019-10-14 23:11:01,090 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:01,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:01,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:01,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-14 23:11:01,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:01,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:01,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:01,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:01,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2019-10-14 23:11:01,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-10-14 23:11:01,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:01,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:01,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:01,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-10-14 23:11:01,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,269 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2019-10-14 23:11:01,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:01,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,362 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2019-10-14 23:11:01,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2019-10-14 23:11:01,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2019-10-14 23:11:01,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2019-10-14 23:11:01,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-10-14 23:11:01,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:33 [2019-10-14 23:11:01,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-10-14 23:11:01,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-10-14 23:11:01,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:01,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2019-10-14 23:11:01,594 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:01,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2019-10-14 23:11:01,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:01,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-10-14 23:11:01,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2019-10-14 23:11:01,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:01,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:38 [2019-10-14 23:11:01,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2019-10-14 23:11:01,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:01,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-10-14 23:11:01,798 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:01,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2019-10-14 23:11:01,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,815 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-10-14 23:11:01,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:48 [2019-10-14 23:11:01,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 113 [2019-10-14 23:11:01,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,981 INFO L567 ElimStorePlain]: treesize reduction 44, result has 62.1 percent of original size [2019-10-14 23:11:01,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:01,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:72 [2019-10-14 23:11:01,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:02,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2019-10-14 23:11:02,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:02,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:02,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:02,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:4 [2019-10-14 23:11:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:02,214 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:02,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2019-10-14 23:11:02,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611597190] [2019-10-14 23:11:02,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-14 23:11:02,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:02,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-14 23:11:02,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2019-10-14 23:11:02,215 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 28 states. [2019-10-14 23:11:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:03,320 INFO L93 Difference]: Finished difference Result 234 states and 285 transitions. [2019-10-14 23:11:03,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:11:03,321 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-10-14 23:11:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:03,322 INFO L225 Difference]: With dead ends: 234 [2019-10-14 23:11:03,322 INFO L226 Difference]: Without dead ends: 220 [2019-10-14 23:11:03,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2019-10-14 23:11:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-14 23:11:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2019-10-14 23:11:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-14 23:11:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2019-10-14 23:11:03,333 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 38 [2019-10-14 23:11:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:03,333 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2019-10-14 23:11:03,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-14 23:11:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2019-10-14 23:11:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:03,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:03,334 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:03,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:03,535 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1285137962, now seen corresponding path program 2 times [2019-10-14 23:11:03,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:03,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821574349] [2019-10-14 23:11:03,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:03,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:03,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:03,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821574349] [2019-10-14 23:11:03,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449926792] [2019-10-14 23:11:03,782 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:03,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:03,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:03,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-14 23:11:03,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:03,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:03,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:03,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:03,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:03,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:03,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,979 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-14 23:11:03,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-14 23:11:04,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:04,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:11:04,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:11:04,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-10-14 23:11:04,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:11:04,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 23:11:04,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:04,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-10-14 23:11:04,158 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:04,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:11:04,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:04,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-14 23:11:04,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-14 23:11:04,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:04,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:30 [2019-10-14 23:11:04,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:11:04,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:04,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-10-14 23:11:04,346 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:04,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-10-14 23:11:04,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,362 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-10-14 23:11:04,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-10-14 23:11:04,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-10-14 23:11:04,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,517 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-10-14 23:11:04,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:04,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-10-14 23:11:04,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:04,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-10-14 23:11:04,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,879 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2019-10-14 23:11:04,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2019-10-14 23:11:04,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:83, output treesize:3 [2019-10-14 23:11:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:04,912 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:04,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2019-10-14 23:11:04,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702462348] [2019-10-14 23:11:04,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 23:11:04,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 23:11:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:11:04,913 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand 27 states. [2019-10-14 23:11:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:06,235 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2019-10-14 23:11:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:11:06,236 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2019-10-14 23:11:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:06,238 INFO L225 Difference]: With dead ends: 210 [2019-10-14 23:11:06,238 INFO L226 Difference]: Without dead ends: 208 [2019-10-14 23:11:06,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2019-10-14 23:11:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-14 23:11:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 122. [2019-10-14 23:11:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-14 23:11:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2019-10-14 23:11:06,248 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 38 [2019-10-14 23:11:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:06,248 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-10-14 23:11:06,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-14 23:11:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2019-10-14 23:11:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:06,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:06,249 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:06,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:06,454 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1455738522, now seen corresponding path program 3 times [2019-10-14 23:11:06,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:06,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558549770] [2019-10-14 23:11:06,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:06,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:06,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:06,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558549770] [2019-10-14 23:11:06,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290590982] [2019-10-14 23:11:06,816 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:07,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:11:07,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:07,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-14 23:11:07,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:07,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:07,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:07,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:07,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2019-10-14 23:11:07,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-10-14 23:11:07,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:07,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:07,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:07,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-10-14 23:11:07,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,173 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,191 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2019-10-14 23:11:07,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:07,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,301 INFO L567 ElimStorePlain]: treesize reduction 14, result has 75.4 percent of original size [2019-10-14 23:11:07,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:43 [2019-10-14 23:11:07,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-10-14 23:11:07,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-10-14 23:11:07,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-14 23:11:07,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:35 [2019-10-14 23:11:07,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:11:07,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,440 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.5 percent of original size [2019-10-14 23:11:07,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2019-10-14 23:11:07,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:07,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:07,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2019-10-14 23:11:07,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2019-10-14 23:11:07,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,576 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-10-14 23:11:07,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:07,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-14 23:11:07,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2019-10-14 23:11:07,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,664 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-10-14 23:11:07,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:07,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2019-10-14 23:11:07,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2019-10-14 23:11:07,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,708 INFO L567 ElimStorePlain]: treesize reduction 8, result has 83.0 percent of original size [2019-10-14 23:11:07,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:07,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-10-14 23:11:07,792 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 57 [2019-10-14 23:11:07,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,822 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.2 percent of original size [2019-10-14 23:11:07,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:07,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:39 [2019-10-14 23:11:07,932 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 112 [2019-10-14 23:11:07,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,994 INFO L567 ElimStorePlain]: treesize reduction 36, result has 63.6 percent of original size [2019-10-14 23:11:07,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:07,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:63 [2019-10-14 23:11:07,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:08,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2019-10-14 23:11:08,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:3 [2019-10-14 23:11:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:08,183 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:08,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2019-10-14 23:11:08,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722918729] [2019-10-14 23:11:08,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-14 23:11:08,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-14 23:11:08,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2019-10-14 23:11:08,184 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand 28 states. [2019-10-14 23:11:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:09,341 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2019-10-14 23:11:09,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:11:09,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-10-14 23:11:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:09,343 INFO L225 Difference]: With dead ends: 176 [2019-10-14 23:11:09,343 INFO L226 Difference]: Without dead ends: 162 [2019-10-14 23:11:09,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=254, Invalid=1228, Unknown=0, NotChecked=0, Total=1482 [2019-10-14 23:11:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-14 23:11:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2019-10-14 23:11:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-14 23:11:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2019-10-14 23:11:09,352 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 38 [2019-10-14 23:11:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:09,353 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2019-10-14 23:11:09,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-14 23:11:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2019-10-14 23:11:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:09,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:09,354 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:09,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:09,555 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:09,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:09,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1455745466, now seen corresponding path program 2 times [2019-10-14 23:11:09,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:09,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53703220] [2019-10-14 23:11:09,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:09,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53703220] [2019-10-14 23:11:09,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886048105] [2019-10-14 23:11:09,791 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:09,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:09,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:09,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-14 23:11:09,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:09,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:09,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:09,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:09,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:09,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:09,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:09,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:09,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:09,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:09,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:09,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:09,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:09,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,014 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-14 23:11:10,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-14 23:11:10,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:10,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:10,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:11:10,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:11:10,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-10-14 23:11:10,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:11:10,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 23:11:10,146 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:10,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-10-14 23:11:10,190 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:10,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:11:10,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:10,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-14 23:11:10,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-14 23:11:10,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:10,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:30 [2019-10-14 23:11:10,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:11:10,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:10,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-10-14 23:11:10,336 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:10,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-10-14 23:11:10,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,352 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-10-14 23:11:10,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-10-14 23:11:10,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-10-14 23:11:10,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,507 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-10-14 23:11:10,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:10,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-10-14 23:11:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:10,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:11:10,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-10-14 23:11:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:10,766 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:10,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2019-10-14 23:11:10,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57239100] [2019-10-14 23:11:10,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 23:11:10,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 23:11:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:11:10,767 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand 27 states.