java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:07:37,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:37,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:37,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:37,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:37,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:37,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:37,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:37,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:37,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:37,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:37,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:37,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:37,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:37,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:37,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:37,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:37,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:37,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:37,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:37,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:37,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:37,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:37,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:37,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:37,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:37,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:37,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:37,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:37,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:37,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:37,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:37,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:37,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:37,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:37,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:37,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:37,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:37,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:37,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:37,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:37,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:07:37,575 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:37,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:37,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:37,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:37,579 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:37,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:37,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:37,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:37,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:37,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:37,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:37,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:37,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:37,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:37,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:37,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:37,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:37,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:37,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:37,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:37,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:37,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:37,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:37,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:37,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:37,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:37,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:37,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:37,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:37,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:37,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:37,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:37,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:37,911 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:37,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-10-14 22:07:37,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8bf23b0/d73d5f125ea34a88b3ad2927c20f8928/FLAG760c2cecd [2019-10-14 22:07:38,483 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:38,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-10-14 22:07:38,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8bf23b0/d73d5f125ea34a88b3ad2927c20f8928/FLAG760c2cecd [2019-10-14 22:07:38,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8bf23b0/d73d5f125ea34a88b3ad2927c20f8928 [2019-10-14 22:07:38,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:38,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:38,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:38,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:38,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:38,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:38" (1/1) ... [2019-10-14 22:07:38,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2890bd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:38, skipping insertion in model container [2019-10-14 22:07:38,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:38" (1/1) ... [2019-10-14 22:07:38,808 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:38,863 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:39,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:39,275 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:39,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:39,376 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:39,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39 WrapperNode [2019-10-14 22:07:39,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:39,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:39,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:39,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:39,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... [2019-10-14 22:07:39,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... [2019-10-14 22:07:39,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... [2019-10-14 22:07:39,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... [2019-10-14 22:07:39,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... [2019-10-14 22:07:39,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... [2019-10-14 22:07:39,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... [2019-10-14 22:07:39,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:39,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:39,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:39,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:39,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:40,116 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:40,116 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-14 22:07:40,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:40 BoogieIcfgContainer [2019-10-14 22:07:40,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:40,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:40,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:40,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:40,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:38" (1/3) ... [2019-10-14 22:07:40,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3c61d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:40, skipping insertion in model container [2019-10-14 22:07:40,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:39" (2/3) ... [2019-10-14 22:07:40,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3c61d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:40, skipping insertion in model container [2019-10-14 22:07:40,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:40" (3/3) ... [2019-10-14 22:07:40,128 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2019-10-14 22:07:40,139 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:40,148 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-14 22:07:40,160 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-14 22:07:40,187 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:40,187 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:40,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:40,187 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:40,188 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:40,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:40,188 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:40,188 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-10-14 22:07:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-14 22:07:40,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:40,215 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:40,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2019-10-14 22:07:40,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:40,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176413737] [2019-10-14 22:07:40,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:40,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176413737] [2019-10-14 22:07:40,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:40,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:07:40,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963618550] [2019-10-14 22:07:40,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:07:40,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:40,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:07:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:40,473 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-10-14 22:07:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:40,621 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2019-10-14 22:07:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:07:40,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-14 22:07:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:40,649 INFO L225 Difference]: With dead ends: 92 [2019-10-14 22:07:40,650 INFO L226 Difference]: Without dead ends: 43 [2019-10-14 22:07:40,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-14 22:07:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-14 22:07:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 22:07:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-14 22:07:40,696 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2019-10-14 22:07:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:40,696 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-14 22:07:40,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:07:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-14 22:07:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-14 22:07:40,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:40,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:40,698 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2019-10-14 22:07:40,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:40,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85906714] [2019-10-14 22:07:40,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:40,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85906714] [2019-10-14 22:07:40,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:40,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:07:40,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784887211] [2019-10-14 22:07:40,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:07:40,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:07:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:40,799 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2019-10-14 22:07:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:40,903 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-14 22:07:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:07:40,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-14 22:07:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:40,905 INFO L225 Difference]: With dead ends: 43 [2019-10-14 22:07:40,905 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 22:07:40,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 22:07:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-14 22:07:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 22:07:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-14 22:07:40,913 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-10-14 22:07:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:40,914 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-14 22:07:40,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:07:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-14 22:07:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 22:07:40,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:40,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:40,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2019-10-14 22:07:40,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:40,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521436511] [2019-10-14 22:07:40,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:40,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521436511] [2019-10-14 22:07:40,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:40,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:07:41,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764668519] [2019-10-14 22:07:41,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:07:41,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:07:41,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:07:41,001 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 5 states. [2019-10-14 22:07:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:41,119 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-14 22:07:41,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:07:41,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-14 22:07:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:41,121 INFO L225 Difference]: With dead ends: 67 [2019-10-14 22:07:41,121 INFO L226 Difference]: Without dead ends: 65 [2019-10-14 22:07:41,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-14 22:07:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-10-14 22:07:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 22:07:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-14 22:07:41,129 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2019-10-14 22:07:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:41,130 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-14 22:07:41,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:07:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-14 22:07:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 22:07:41,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:41,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:41,131 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:41,132 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2019-10-14 22:07:41,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:41,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426329960] [2019-10-14 22:07:41,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:41,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426329960] [2019-10-14 22:07:41,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:41,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:41,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302893988] [2019-10-14 22:07:41,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:41,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:41,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:41,213 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 6 states. [2019-10-14 22:07:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:41,351 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-14 22:07:41,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:07:41,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 22:07:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:41,352 INFO L225 Difference]: With dead ends: 39 [2019-10-14 22:07:41,352 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 22:07:41,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 22:07:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-14 22:07:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 22:07:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-14 22:07:41,358 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2019-10-14 22:07:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:41,359 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-14 22:07:41,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-14 22:07:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 22:07:41,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:41,360 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:41,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:41,361 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2019-10-14 22:07:41,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:41,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717622307] [2019-10-14 22:07:41,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:41,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717622307] [2019-10-14 22:07:41,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:41,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:41,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849219390] [2019-10-14 22:07:41,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:41,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:41,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:41,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:41,573 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2019-10-14 22:07:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:41,782 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-10-14 22:07:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:07:41,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 22:07:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:41,784 INFO L225 Difference]: With dead ends: 72 [2019-10-14 22:07:41,784 INFO L226 Difference]: Without dead ends: 48 [2019-10-14 22:07:41,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-14 22:07:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-10-14 22:07:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 22:07:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-14 22:07:41,793 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2019-10-14 22:07:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:41,793 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-14 22:07:41,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-14 22:07:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:41,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:41,795 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:41,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2019-10-14 22:07:41,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:41,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225677688] [2019-10-14 22:07:41,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:41,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225677688] [2019-10-14 22:07:41,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:41,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:07:41,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031323595] [2019-10-14 22:07:41,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:41,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:41,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:41,939 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 7 states. [2019-10-14 22:07:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:42,128 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-10-14 22:07:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:42,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 22:07:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:42,129 INFO L225 Difference]: With dead ends: 54 [2019-10-14 22:07:42,130 INFO L226 Difference]: Without dead ends: 52 [2019-10-14 22:07:42,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-14 22:07:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-10-14 22:07:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 22:07:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-14 22:07:42,137 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2019-10-14 22:07:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:42,137 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-14 22:07:42,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-14 22:07:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:42,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:42,139 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:42,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:42,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1742673852, now seen corresponding path program 1 times [2019-10-14 22:07:42,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:42,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929975451] [2019-10-14 22:07:42,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:42,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:42,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:42,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929975451] [2019-10-14 22:07:42,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498208609] [2019-10-14 22:07:42,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:42,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 22:07:42,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:42,571 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 22:07:42,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:42,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-14 22:07:42,668 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:42,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,713 INFO L567 ElimStorePlain]: treesize reduction 14, result has 79.7 percent of original size [2019-10-14 22:07:42,722 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:42,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:42,747 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 29 [2019-10-14 22:07:42,748 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,763 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:36 [2019-10-14 22:07:42,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 22:07:42,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,849 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|], 10=[|v_#memory_int_26|]} [2019-10-14 22:07:42,855 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:42,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,896 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-14 22:07:42,896 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 2 case distinctions, treesize of input 56 treesize of output 39 [2019-10-14 22:07:42,897 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:42,938 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:72, output treesize:41 [2019-10-14 22:07:43,018 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 33 treesize of output 13 [2019-10-14 22:07:43,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,034 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 22:07:43,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-14 22:07:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:43,040 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:43,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-10-14 22:07:43,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643592141] [2019-10-14 22:07:43,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 22:07:43,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:43,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 22:07:43,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:43,042 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 10 states. [2019-10-14 22:07:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:43,361 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-10-14 22:07:43,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:43,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-10-14 22:07:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:43,363 INFO L225 Difference]: With dead ends: 62 [2019-10-14 22:07:43,363 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 22:07:43,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:07:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 22:07:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-10-14 22:07:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 22:07:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-14 22:07:43,375 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2019-10-14 22:07:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:43,375 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-14 22:07:43,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 22:07:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-14 22:07:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 22:07:43,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:43,379 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 22:07:43,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:43,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash 995688324, now seen corresponding path program 1 times [2019-10-14 22:07:43,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:43,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555068025] [2019-10-14 22:07:43,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:43,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:43,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:43,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555068025] [2019-10-14 22:07:43,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558233996] [2019-10-14 22:07:43,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 22:07:43,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:43,929 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 22:07:43,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:43,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-14 22:07:44,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:44,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,038 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:44,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:44,061 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 29 [2019-10-14 22:07:44,062 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,091 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:26 [2019-10-14 22:07:44,115 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_29|], 10=[|v_#memory_int_31|]} [2019-10-14 22:07:44,118 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:44,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,230 INFO L341 Elim1Store]: treesize reduction 30, result has 75.8 percent of original size [2019-10-14 22:07:44,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 107 [2019-10-14 22:07:44,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,297 INFO L567 ElimStorePlain]: treesize reduction 48, result has 55.6 percent of original size [2019-10-14 22:07:44,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:44,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:98 [2019-10-14 22:07:44,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:44,438 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 28 treesize of output 14 [2019-10-14 22:07:44,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-10-14 22:07:44,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:44,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:7 [2019-10-14 22:07:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:44,472 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:44,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-14 22:07:44,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670898691] [2019-10-14 22:07:44,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 22:07:44,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 22:07:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:07:44,474 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2019-10-14 22:07:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:44,849 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-10-14 22:07:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:44,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-10-14 22:07:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:44,850 INFO L225 Difference]: With dead ends: 72 [2019-10-14 22:07:44,850 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 22:07:44,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-14 22:07:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 22:07:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-10-14 22:07:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 22:07:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-10-14 22:07:44,857 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2019-10-14 22:07:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:44,857 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-10-14 22:07:44,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 22:07:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-10-14 22:07:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 22:07:44,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:44,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:45,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:45,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:45,063 INFO L82 PathProgramCache]: Analyzing trace with hash 961492076, now seen corresponding path program 1 times [2019-10-14 22:07:45,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:45,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425771772] [2019-10-14 22:07:45,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:45,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:45,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:45,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425771772] [2019-10-14 22:07:45,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:45,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:45,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092524299] [2019-10-14 22:07:45,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:45,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:45,125 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2019-10-14 22:07:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:45,243 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-10-14 22:07:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:07:45,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-14 22:07:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:45,244 INFO L225 Difference]: With dead ends: 54 [2019-10-14 22:07:45,244 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 22:07:45,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 22:07:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-14 22:07:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 22:07:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-10-14 22:07:45,259 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 26 [2019-10-14 22:07:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:45,259 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-10-14 22:07:45,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-10-14 22:07:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 22:07:45,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:45,261 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:45,263 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1379228979, now seen corresponding path program 1 times [2019-10-14 22:07:45,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:45,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824528793] [2019-10-14 22:07:45,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:45,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:45,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:45,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824528793] [2019-10-14 22:07:45,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780787570] [2019-10-14 22:07:45,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-14 22:07:45,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:45,686 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 22:07:45,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:45,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:45,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:45,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:45,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:45,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:45,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:45,784 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-10-14 22:07:45,791 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 35 treesize of output 7 [2019-10-14 22:07:45,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:45,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:45,812 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 35 treesize of output 7 [2019-10-14 22:07:45,812 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:45,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:45,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:45,825 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-10-14 22:07:45,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:45,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:45,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:45,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:45,972 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 2=[|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|, |v_#memory_int_32|], 4=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|]} [2019-10-14 22:07:45,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:45,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-10-14 22:07:45,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:46,080 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 124 [2019-10-14 22:07:46,081 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,160 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 39 treesize of output 11 [2019-10-14 22:07:46,160 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,210 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 25 treesize of output 24 [2019-10-14 22:07:46,210 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,295 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.7 percent of original size [2019-10-14 22:07:46,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:46,304 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 22 [2019-10-14 22:07:46,305 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:46,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:46,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,351 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 54 [2019-10-14 22:07:46,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:46,354 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,400 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2019-10-14 22:07:46,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:46,402 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:243, output treesize:68 [2019-10-14 22:07:46,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:46,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,518 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 59 treesize of output 42 [2019-10-14 22:07:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:46,521 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:46,555 INFO L567 ElimStorePlain]: treesize reduction 12, result has 81.0 percent of original size [2019-10-14 22:07:46,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:46,570 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 22:07:46,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:46,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:33 [2019-10-14 22:07:46,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:46,673 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-10-14 22:07:46,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 40 [2019-10-14 22:07:46,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,700 INFO L567 ElimStorePlain]: treesize reduction 8, result has 73.3 percent of original size [2019-10-14 22:07:46,702 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 22:07:46,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-10-14 22:07:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:46,723 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:46,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-10-14 22:07:46,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123247103] [2019-10-14 22:07:46,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:46,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:46,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:46,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:46,725 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 15 states. [2019-10-14 22:07:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:47,154 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-14 22:07:47,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:07:47,155 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-10-14 22:07:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:47,156 INFO L225 Difference]: With dead ends: 70 [2019-10-14 22:07:47,156 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 22:07:47,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 22:07:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-10-14 22:07:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 22:07:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-14 22:07:47,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 26 [2019-10-14 22:07:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:47,165 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-14 22:07:47,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:07:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-14 22:07:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 22:07:47,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:47,167 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:47,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:47,370 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:47,371 INFO L82 PathProgramCache]: Analyzing trace with hash 993748211, now seen corresponding path program 1 times [2019-10-14 22:07:47,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:47,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345900457] [2019-10-14 22:07:47,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:47,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345900457] [2019-10-14 22:07:47,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319779265] [2019-10-14 22:07:47,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-14 22:07:47,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:47,723 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 22:07:47,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:47,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:47,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,841 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-10-14 22:07:47,848 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 35 treesize of output 7 [2019-10-14 22:07:47,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,873 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 35 treesize of output 7 [2019-10-14 22:07:47,874 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,888 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-10-14 22:07:47,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:47,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,020 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_23|], 4=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|]} [2019-10-14 22:07:48,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:48,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,107 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 147 [2019-10-14 22:07:48,108 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,188 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 164 treesize of output 134 [2019-10-14 22:07:48,189 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,237 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 125 treesize of output 75 [2019-10-14 22:07:48,238 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:48,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,288 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 57 [2019-10-14 22:07:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,290 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,333 INFO L567 ElimStorePlain]: treesize reduction 24, result has 73.6 percent of original size [2019-10-14 22:07:48,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,334 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:244, output treesize:88 [2019-10-14 22:07:48,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:48,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,537 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 85 treesize of output 48 [2019-10-14 22:07:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,540 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:48,585 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.7 percent of original size [2019-10-14 22:07:48,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 16 [2019-10-14 22:07:48,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:48,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:18 [2019-10-14 22:07:48,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-10-14 22:07:48,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-14 22:07:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:48,648 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:48,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-10-14 22:07:48,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301095311] [2019-10-14 22:07:48,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 22:07:48,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 22:07:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:07:48,650 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 16 states. [2019-10-14 22:07:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:49,186 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-10-14 22:07:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 22:07:49,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-10-14 22:07:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:49,190 INFO L225 Difference]: With dead ends: 58 [2019-10-14 22:07:49,190 INFO L226 Difference]: Without dead ends: 39 [2019-10-14 22:07:49,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:07:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-14 22:07:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-14 22:07:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 22:07:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-14 22:07:49,202 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2019-10-14 22:07:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:49,203 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-14 22:07:49,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 22:07:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-14 22:07:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 22:07:49,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:49,206 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:49,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:49,413 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:49,413 INFO L82 PathProgramCache]: Analyzing trace with hash -117947236, now seen corresponding path program 2 times [2019-10-14 22:07:49,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:49,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11146824] [2019-10-14 22:07:49,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:49,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:49,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:49,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11146824] [2019-10-14 22:07:49,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766163263] [2019-10-14 22:07:49,753 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:49,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:49,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:49,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-14 22:07:49,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:49,876 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 22:07:49,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:49,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:49,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,988 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.1 percent of original size [2019-10-14 22:07:49,995 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 35 treesize of output 7 [2019-10-14 22:07:49,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,026 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 35 treesize of output 7 [2019-10-14 22:07:50,027 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,047 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 22:07:50,047 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,066 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:44 [2019-10-14 22:07:50,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:07:50,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,310 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-14 22:07:50,310 INFO L567 ElimStorePlain]: treesize reduction 40, result has 84.2 percent of original size [2019-10-14 22:07:50,312 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|, |v_#memory_int_36|], 4=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|]} [2019-10-14 22:07:50,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:50,323 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 41 treesize of output 17 [2019-10-14 22:07:50,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-10-14 22:07:50,392 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:50,504 INFO L341 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2019-10-14 22:07:50,505 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 2 case distinctions, treesize of input 141 treesize of output 101 [2019-10-14 22:07:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:50,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:50,508 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,588 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.4 percent of original size [2019-10-14 22:07:50,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:50,596 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 59 treesize of output 22 [2019-10-14 22:07:50,596 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:50,632 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:207, output treesize:83 [2019-10-14 22:07:50,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:50,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 22:07:50,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:50,868 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-14 22:07:50,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:50,870 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|], 6=[|v_#memory_$Pointer$.base_27|], 10=[|v_#memory_int_39|]} [2019-10-14 22:07:50,875 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:51,004 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-14 22:07:51,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 11 [2019-10-14 22:07:51,030 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,139 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-14 22:07:51,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,144 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:51,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 26 [2019-10-14 22:07:51,234 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:51,559 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-10-14 22:07:51,560 INFO L341 Elim1Store]: treesize reduction 174, result has 44.2 percent of original size [2019-10-14 22:07:51,560 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 5 case distinctions, treesize of input 242 treesize of output 224 [2019-10-14 22:07:51,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:51,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:51,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:51,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:51,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:51,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:51,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:51,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:51,591 INFO L496 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-14 22:07:51,936 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2019-10-14 22:07:51,937 INFO L567 ElimStorePlain]: treesize reduction 164, result has 61.9 percent of original size [2019-10-14 22:07:51,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:52,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 103 [2019-10-14 22:07:52,002 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:52,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 107 [2019-10-14 22:07:52,037 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,141 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-14 22:07:52,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:52,146 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:384, output treesize:332 [2019-10-14 22:07:52,230 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-10-14 22:07:52,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-10-14 22:07:52,237 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:52,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:52,287 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 89 [2019-10-14 22:07:52,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,294 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:52,357 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.5 percent of original size [2019-10-14 22:07:52,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:52,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:179, output treesize:49 [2019-10-14 22:07:52,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:52,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-10-14 22:07:52,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:3 [2019-10-14 22:07:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:52,444 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:52,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-10-14 22:07:52,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642216362] [2019-10-14 22:07:52,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:07:52,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:07:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-14 22:07:52,450 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 14 states. [2019-10-14 22:07:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:53,102 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-10-14 22:07:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 22:07:53,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-10-14 22:07:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:53,105 INFO L225 Difference]: With dead ends: 76 [2019-10-14 22:07:53,105 INFO L226 Difference]: Without dead ends: 74 [2019-10-14 22:07:53,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-14 22:07:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2019-10-14 22:07:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 22:07:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-10-14 22:07:53,115 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 30 [2019-10-14 22:07:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:53,115 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-10-14 22:07:53,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 22:07:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-10-14 22:07:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 22:07:53,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:53,117 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:53,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:53,340 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1845129180, now seen corresponding path program 2 times [2019-10-14 22:07:53,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:53,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377308163] [2019-10-14 22:07:53,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:53,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377308163] [2019-10-14 22:07:53,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959715054] [2019-10-14 22:07:53,718 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:53,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:53,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:53,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-14 22:07:53,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:53,844 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 22:07:53,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:53,882 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:53,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,976 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.1 percent of original size [2019-10-14 22:07:53,985 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 35 treesize of output 7 [2019-10-14 22:07:53,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,016 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 35 treesize of output 7 [2019-10-14 22:07:54,017 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,039 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 22:07:54,040 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,059 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:44 [2019-10-14 22:07:54,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:07:54,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,332 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-14 22:07:54,332 INFO L567 ElimStorePlain]: treesize reduction 40, result has 84.4 percent of original size [2019-10-14 22:07:54,337 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|, |v_#memory_int_43|], 4=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|]} [2019-10-14 22:07:54,363 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:54,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2019-10-14 22:07:54,468 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:54,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,580 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 98 [2019-10-14 22:07:54,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,582 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,716 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-14 22:07:54,716 INFO L567 ElimStorePlain]: treesize reduction 24, result has 86.0 percent of original size [2019-10-14 22:07:54,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2019-10-14 22:07:54,726 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:54,778 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:210, output treesize:97 [2019-10-14 22:07:54,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 22:07:54,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,127 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-14 22:07:55,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,130 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 1=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|], 4=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|], 7=[|v_#memory_int_44|]} [2019-10-14 22:07:55,136 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:55,266 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-14 22:07:55,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,272 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:55,399 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-14 22:07:55,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,403 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:55,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,481 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:55,549 INFO L341 Elim1Store]: treesize reduction 16, result has 80.5 percent of original size [2019-10-14 22:07:55,549 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 291 treesize of output 188 [2019-10-14 22:07:55,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,555 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,697 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-14 22:07:55,698 INFO L567 ElimStorePlain]: treesize reduction 52, result has 82.4 percent of original size [2019-10-14 22:07:55,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 55 [2019-10-14 22:07:55,710 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,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, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 57 [2019-10-14 22:07:55,771 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,850 INFO L567 ElimStorePlain]: treesize reduction 20, result has 87.7 percent of original size [2019-10-14 22:07:55,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:55,852 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:373, output treesize:106 [2019-10-14 22:07:56,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:56,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 75 [2019-10-14 22:07:56,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:56,034 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:56,083 INFO L567 ElimStorePlain]: treesize reduction 24, result has 74.2 percent of original size [2019-10-14 22:07:56,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:56,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:56,091 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 22:07:56,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:56,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:124, output treesize:44 [2019-10-14 22:07:56,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:56,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 56 [2019-10-14 22:07:56,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,227 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.0 percent of original size [2019-10-14 22:07:56,228 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 22:07:56,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:3 [2019-10-14 22:07:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:56,260 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:56,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2019-10-14 22:07:56,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651361430] [2019-10-14 22:07:56,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:07:56,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:07:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:56,262 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 19 states. [2019-10-14 22:07:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:57,192 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-10-14 22:07:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 22:07:57,192 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-10-14 22:07:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:57,193 INFO L225 Difference]: With dead ends: 74 [2019-10-14 22:07:57,193 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 22:07:57,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2019-10-14 22:07:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 22:07:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2019-10-14 22:07:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 22:07:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-10-14 22:07:57,199 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2019-10-14 22:07:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:57,200 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-10-14 22:07:57,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:07:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-10-14 22:07:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 22:07:57,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:57,201 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:57,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:57,406 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1648105355, now seen corresponding path program 3 times [2019-10-14 22:07:57,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:57,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936753587] [2019-10-14 22:07:57,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936753587] [2019-10-14 22:07:57,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192737466] [2019-10-14 22:07:57,857 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:58,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:07:58,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:58,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 22:07:58,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:58,069 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 22:07:58,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:58,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:58,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,162 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-10-14 22:07:58,166 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 35 treesize of output 7 [2019-10-14 22:07:58,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,200 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 35 treesize of output 7 [2019-10-14 22:07:58,201 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,210 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-10-14 22:07:58,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:07:58,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,391 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-14 22:07:58,392 INFO L567 ElimStorePlain]: treesize reduction 40, result has 81.7 percent of original size [2019-10-14 22:07:58,396 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:58,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,410 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 94 [2019-10-14 22:07:58,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,472 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.0 percent of original size [2019-10-14 22:07:58,515 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,515 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 71 [2019-10-14 22:07:58,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,517 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-10-14 22:07:58,567 INFO L567 ElimStorePlain]: treesize reduction 77, result has 51.9 percent of original size [2019-10-14 22:07:58,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,568 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:172, output treesize:82 [2019-10-14 22:07:58,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-10-14 22:07:58,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,798 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-14 22:07:58,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,802 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|, |v_#memory_int_46|], 1=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|], 4=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|]} [2019-10-14 22:07:58,807 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:58,946 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-14 22:07:58,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 46 [2019-10-14 22:07:58,955 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,140 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-14 22:07:59,141 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.0 percent of original size [2019-10-14 22:07:59,145 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:59,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,225 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:59,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,297 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:59,397 INFO L341 Elim1Store]: treesize reduction 16, result has 82.2 percent of original size [2019-10-14 22:07:59,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, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 268 treesize of output 161 [2019-10-14 22:07:59,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,404 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-10-14 22:07:59,556 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-10-14 22:07:59,556 INFO L567 ElimStorePlain]: treesize reduction 592, result has 26.6 percent of original size [2019-10-14 22:07:59,683 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-14 22:07:59,684 INFO L341 Elim1Store]: treesize reduction 27, result has 83.1 percent of original size [2019-10-14 22:07:59,684 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 231 [2019-10-14 22:07:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:59,724 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:59,829 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-10-14 22:07:59,829 INFO L567 ElimStorePlain]: treesize reduction 163, result has 45.7 percent of original size [2019-10-14 22:07:59,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,831 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:430, output treesize:138 [2019-10-14 22:07:59,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:59,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 85 [2019-10-14 22:07:59,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,950 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:00,012 INFO L567 ElimStorePlain]: treesize reduction 12, result has 86.7 percent of original size [2019-10-14 22:08:00,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2019-10-14 22:08:00,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:00,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:165, output treesize:18 [2019-10-14 22:08:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:00,110 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:00,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-14 22:08:00,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798908163] [2019-10-14 22:08:00,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:08:00,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:08:00,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:08:00,112 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2019-10-14 22:08:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:00,557 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-10-14 22:08:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:00,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-10-14 22:08:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:00,558 INFO L225 Difference]: With dead ends: 86 [2019-10-14 22:08:00,558 INFO L226 Difference]: Without dead ends: 70 [2019-10-14 22:08:00,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:08:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-14 22:08:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-10-14 22:08:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 22:08:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-14 22:08:00,575 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 36 [2019-10-14 22:08:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:00,577 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-14 22:08:00,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:08:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-14 22:08:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 22:08:00,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:00,583 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, 1, 1, 1, 1] [2019-10-14 22:08:00,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:00,784 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash 439169867, now seen corresponding path program 3 times [2019-10-14 22:08:00,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:00,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397972323] [2019-10-14 22:08:00,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:01,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397972323] [2019-10-14 22:08:01,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959223262] [2019-10-14 22:08:01,167 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:01,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:08:01,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:01,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-14 22:08:01,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:01,341 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 22:08:01,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:01,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:01,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,423 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-10-14 22:08:01,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:08:01,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:08:01,449 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,463 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-10-14 22:08:01,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:01,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,641 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-14 22:08:01,642 INFO L567 ElimStorePlain]: treesize reduction 40, result has 81.7 percent of original size [2019-10-14 22:08:01,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:01,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,664 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,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, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 94 [2019-10-14 22:08:01,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:01,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,732 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.0 percent of original size [2019-10-14 22:08:01,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,754 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 71 [2019-10-14 22:08:01,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:01,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:01,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:01,756 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-10-14 22:08:01,832 INFO L567 ElimStorePlain]: treesize reduction 190, result has 30.4 percent of original size [2019-10-14 22:08:01,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,833 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:172, output treesize:82 [2019-10-14 22:08:01,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-10-14 22:08:01,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,015 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 1=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|], 4=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|]} [2019-10-14 22:08:02,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:02,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,165 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-14 22:08:02,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,171 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:02,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,275 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:02,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:02,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:02,426 INFO L341 Elim1Store]: treesize reduction 16, result has 82.2 percent of original size [2019-10-14 22:08:02,426 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 246 treesize of output 151 [2019-10-14 22:08:02,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,430 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,531 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-10-14 22:08:02,531 INFO L567 ElimStorePlain]: treesize reduction 300, result has 39.0 percent of original size [2019-10-14 22:08:02,653 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-14 22:08:02,653 INFO L341 Elim1Store]: treesize reduction 27, result has 83.1 percent of original size [2019-10-14 22:08:02,654 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 205 [2019-10-14 22:08:02,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,717 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:02,832 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-10-14 22:08:02,833 INFO L567 ElimStorePlain]: treesize reduction 163, result has 42.2 percent of original size [2019-10-14 22:08:02,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,834 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:376, output treesize:151 [2019-10-14 22:08:03,135 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-10-14 22:08:03,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:03,559 INFO L341 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2019-10-14 22:08:03,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 193 treesize of output 130 [2019-10-14 22:08:03,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,576 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:03,676 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.5 percent of original size [2019-10-14 22:08:03,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,701 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 39 [2019-10-14 22:08:03,702 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:03,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:03,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:214, output treesize:37 [2019-10-14 22:08:03,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:03,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 29 [2019-10-14 22:08:03,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,860 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 22:08:03,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-10-14 22:08:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:03,900 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:03,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2019-10-14 22:08:03,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395894149] [2019-10-14 22:08:03,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 22:08:03,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 22:08:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:08:03,903 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 22 states. [2019-10-14 22:08:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:04,730 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-10-14 22:08:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:08:04,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-10-14 22:08:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:04,732 INFO L225 Difference]: With dead ends: 74 [2019-10-14 22:08:04,732 INFO L226 Difference]: Without dead ends: 49 [2019-10-14 22:08:04,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-10-14 22:08:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-14 22:08:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-14 22:08:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 22:08:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-10-14 22:08:04,739 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 40 [2019-10-14 22:08:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:04,740 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-10-14 22:08:04,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 22:08:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-10-14 22:08:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 22:08:04,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:04,741 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:04,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:04,946 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1838649268, now seen corresponding path program 4 times [2019-10-14 22:08:04,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:04,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182212421] [2019-10-14 22:08:04,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:05,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182212421] [2019-10-14 22:08:05,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404801324] [2019-10-14 22:08:05,453 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:05,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 22:08:05,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:05,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-14 22:08:05,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:05,671 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 22:08:05,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:05,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:05,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,770 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-10-14 22:08:05,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:08:05,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,797 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 35 treesize of output 7 [2019-10-14 22:08:05,797 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,810 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-10-14 22:08:05,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:05,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,969 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-14 22:08:05,970 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.8 percent of original size [2019-10-14 22:08:05,971 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|], 4=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|]} [2019-10-14 22:08:05,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:08:05,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 82 [2019-10-14 22:08:06,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:06,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:06,041 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,104 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.5 percent of original size [2019-10-14 22:08:06,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,114 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 59 treesize of output 22 [2019-10-14 22:08:06,114 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,139 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:162, output treesize:76 [2019-10-14 22:08:06,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-10-14 22:08:06,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,469 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-10-14 22:08:06,469 INFO L567 ElimStorePlain]: treesize reduction 78, result has 80.2 percent of original size [2019-10-14 22:08:06,470 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_49|, |v_#memory_int_51|], 10=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_43|]} [2019-10-14 22:08:06,473 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:06,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 45 [2019-10-14 22:08:06,564 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 43 [2019-10-14 22:08:06,639 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,736 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 124 [2019-10-14 22:08:06,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:06,739 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,842 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-10-14 22:08:06,842 INFO L567 ElimStorePlain]: treesize reduction 100, result has 60.3 percent of original size [2019-10-14 22:08:06,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,843 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:298, output treesize:137 [2019-10-14 22:08:06,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 72 [2019-10-14 22:08:06,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,129 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-14 22:08:07,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,130 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_50|], 4=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|], 9=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|], 10=[|v_#memory_int_52|]} [2019-10-14 22:08:07,134 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,264 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-14 22:08:07,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,267 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,373 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-14 22:08:07,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,377 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:07,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:07,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:07,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 312 [2019-10-14 22:08:07,497 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,650 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-14 22:08:07,650 INFO L567 ElimStorePlain]: treesize reduction 94, result has 84.7 percent of original size [2019-10-14 22:08:07,882 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-10-14 22:08:07,882 INFO L341 Elim1Store]: treesize reduction 176, result has 41.3 percent of original size [2019-10-14 22:08:07,883 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 8 new quantified variables, introduced 8 case distinctions, treesize of input 505 treesize of output 284 [2019-10-14 22:08:07,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,896 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,023 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-14 22:08:08,024 INFO L567 ElimStorePlain]: treesize reduction 96, result has 80.1 percent of original size [2019-10-14 22:08:08,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 93 [2019-10-14 22:08:08,037 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,124 INFO L567 ElimStorePlain]: treesize reduction 28, result has 90.4 percent of original size [2019-10-14 22:08:08,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,125 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:661, output treesize:219 [2019-10-14 22:08:08,626 INFO L341 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-10-14 22:08:08,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 207 treesize of output 166 [2019-10-14 22:08:08,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,661 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,758 INFO L567 ElimStorePlain]: treesize reduction 76, result has 56.3 percent of original size [2019-10-14 22:08:08,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 63 [2019-10-14 22:08:08,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:221, output treesize:36 [2019-10-14 22:08:08,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,907 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 5 case distinctions, treesize of input 36 treesize of output 56 [2019-10-14 22:08:08,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,923 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 22:08:08,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2019-10-14 22:08:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:08,950 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:08,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2019-10-14 22:08:08,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581296213] [2019-10-14 22:08:08,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 22:08:08,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:08,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 22:08:08,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:08:08,951 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2019-10-14 22:08:09,934 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-14 22:08:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:10,310 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-10-14 22:08:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 22:08:10,310 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-10-14 22:08:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:10,312 INFO L225 Difference]: With dead ends: 92 [2019-10-14 22:08:10,312 INFO L226 Difference]: Without dead ends: 90 [2019-10-14 22:08:10,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2019-10-14 22:08:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-14 22:08:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 55. [2019-10-14 22:08:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 22:08:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-10-14 22:08:10,319 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 40 [2019-10-14 22:08:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:10,320 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-10-14 22:08:10,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 22:08:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-10-14 22:08:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 22:08:10,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:10,321 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:10,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:10,525 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1655804172, now seen corresponding path program 4 times [2019-10-14 22:08:10,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:10,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428749239] [2019-10-14 22:08:10,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:10,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:10,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:11,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428749239] [2019-10-14 22:08:11,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894680174] [2019-10-14 22:08:11,081 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 22:08:11,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 22:08:11,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:11,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-14 22:08:11,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:11,217 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 22:08:11,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:11,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:11,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,311 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-10-14 22:08:11,318 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 35 treesize of output 7 [2019-10-14 22:08:11,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,342 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 35 treesize of output 7 [2019-10-14 22:08:11,342 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,357 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-10-14 22:08:11,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:11,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,547 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-14 22:08:11,548 INFO L567 ElimStorePlain]: treesize reduction 40, result has 82.1 percent of original size [2019-10-14 22:08:11,549 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_53|], 4=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_47|]} [2019-10-14 22:08:11,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:08:11,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:11,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,618 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 94 [2019-10-14 22:08:11,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:11,620 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,689 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.2 percent of original size [2019-10-14 22:08:11,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,710 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 68 [2019-10-14 22:08:11,711 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,767 INFO L567 ElimStorePlain]: treesize reduction 32, result has 70.4 percent of original size [2019-10-14 22:08:11,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,767 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:178, output treesize:76 [2019-10-14 22:08:11,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:11,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-10-14 22:08:11,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:12,172 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-10-14 22:08:12,172 INFO L567 ElimStorePlain]: treesize reduction 78, result has 82.5 percent of original size [2019-10-14 22:08:12,174 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_56|, |v_#memory_int_54|], 10=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|]} [2019-10-14 22:08:12,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:12,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 29 [2019-10-14 22:08:12,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:12,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:12,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2019-10-14 22:08:12,280 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:12,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:12,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:12,461 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-14 22:08:12,462 INFO L341 Elim1Store]: treesize reduction 24, result has 78.6 percent of original size [2019-10-14 22:08:12,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 5 new quantified variables, introduced 4 case distinctions, treesize of input 273 treesize of output 190 [2019-10-14 22:08:12,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:12,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:12,473 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-10-14 22:08:12,608 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-14 22:08:12,609 INFO L567 ElimStorePlain]: treesize reduction 302, result has 42.4 percent of original size [2019-10-14 22:08:12,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:12,660 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 221 [2019-10-14 22:08:12,661 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:12,751 INFO L567 ElimStorePlain]: treesize reduction 84, result has 61.6 percent of original size [2019-10-14 22:08:12,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:12,753 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:350, output treesize:135 [2019-10-14 22:08:12,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:12,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:12,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:12,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:12,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 72 [2019-10-14 22:08:12,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,030 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 22:08:13,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,035 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 1=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|], 3=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|, |v_#memory_int_57|]} [2019-10-14 22:08:13,045 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:13,157 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 22:08:13,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,160 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:13,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,264 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:13,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,470 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-14 22:08:13,470 INFO L341 Elim1Store]: treesize reduction 16, result has 86.8 percent of original size [2019-10-14 22:08:13,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 408 treesize of output 243 [2019-10-14 22:08:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:13,485 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,613 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-10-14 22:08:13,614 INFO L567 ElimStorePlain]: treesize reduction 136, result has 69.8 percent of original size [2019-10-14 22:08:13,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 [2019-10-14 22:08:13,628 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 67 [2019-10-14 22:08:13,682 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,764 INFO L567 ElimStorePlain]: treesize reduction 28, result has 86.9 percent of original size [2019-10-14 22:08:13,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,765 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:505, output treesize:157 [2019-10-14 22:08:14,066 INFO L341 Elim1Store]: treesize reduction 24, result has 68.4 percent of original size [2019-10-14 22:08:14,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 121 [2019-10-14 22:08:14,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,083 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:14,153 INFO L567 ElimStorePlain]: treesize reduction 32, result has 73.3 percent of original size [2019-10-14 22:08:14,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2019-10-14 22:08:14,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:14,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:171, output treesize:36 [2019-10-14 22:08:14,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,248 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 5 case distinctions, treesize of input 36 treesize of output 56 [2019-10-14 22:08:14,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,264 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 22:08:14,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2019-10-14 22:08:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:14,316 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:14,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2019-10-14 22:08:14,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663946556] [2019-10-14 22:08:14,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 22:08:14,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 22:08:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:08:14,317 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 23 states. [2019-10-14 22:08:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:15,777 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-10-14 22:08:15,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 22:08:15,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-10-14 22:08:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:15,779 INFO L225 Difference]: With dead ends: 135 [2019-10-14 22:08:15,779 INFO L226 Difference]: Without dead ends: 127 [2019-10-14 22:08:15,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 22:08:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-14 22:08:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2019-10-14 22:08:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-14 22:08:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-10-14 22:08:15,791 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 44 [2019-10-14 22:08:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:15,792 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-10-14 22:08:15,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 22:08:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-10-14 22:08:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 22:08:15,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:15,793 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:15,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:15,998 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash 210546851, now seen corresponding path program 5 times [2019-10-14 22:08:15,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:15,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942817045] [2019-10-14 22:08:15,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:15,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:15,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:16,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942817045] [2019-10-14 22:08:16,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063581345] [2019-10-14 22:08:16,748 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 22:08:16,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-14 22:08:16,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:16,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-14 22:08:16,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:16,923 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 22:08:16,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:16,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:16,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:16,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:08:16,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:16,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:16,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,023 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.3 percent of original size [2019-10-14 22:08:17,027 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 35 treesize of output 7 [2019-10-14 22:08:17,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:17,049 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 35 treesize of output 7 [2019-10-14 22:08:17,049 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:17,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,061 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:90, output treesize:32 [2019-10-14 22:08:17,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:17,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:17,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,239 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.8 percent of original size [2019-10-14 22:08:17,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:17,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, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 110 [2019-10-14 22:08:17,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:17,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,330 INFO L567 ElimStorePlain]: treesize reduction 24, result has 83.8 percent of original size [2019-10-14 22:08:17,343 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 82 treesize of output 36 [2019-10-14 22:08:17,344 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:17,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,363 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:162, output treesize:80