java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/calendar.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:07:41,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:41,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:41,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:41,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:41,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:41,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:41,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:41,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:41,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:41,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:41,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:41,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:41,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:41,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:41,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:41,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:41,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:41,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:41,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:41,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:41,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:41,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:41,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:41,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:41,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:41,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:41,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:41,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:41,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:41,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:41,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:41,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:41,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:41,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:41,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:41,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:41,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:41,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:41,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:41,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:41,592 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:41,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:41,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:41,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:41,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:41,621 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:41,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:41,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:41,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:41,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:41,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:41,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:41,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:41,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:41,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:41,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:41,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:41,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:41,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:41,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:41,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:41,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:41,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:41,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:41,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:41,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:41,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:41,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:41,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:41,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:41,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:41,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:41,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:41,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:41,924 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:41,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/calendar.i [2019-10-14 22:07:41,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e609af90/cc7d3fcbe1aa4680a3db41b232fa4666/FLAG08c928143 [2019-10-14 22:07:42,519 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:42,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/calendar.i [2019-10-14 22:07:42,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e609af90/cc7d3fcbe1aa4680a3db41b232fa4666/FLAG08c928143 [2019-10-14 22:07:42,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e609af90/cc7d3fcbe1aa4680a3db41b232fa4666 [2019-10-14 22:07:42,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:42,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:42,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:42,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:42,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:42,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:42" (1/1) ... [2019-10-14 22:07:42,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432d2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:42, skipping insertion in model container [2019-10-14 22:07:42,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:42" (1/1) ... [2019-10-14 22:07:42,860 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:42,901 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:43,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:43,320 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:43,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:43,415 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:43,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:43 WrapperNode [2019-10-14 22:07:43,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:43,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:43,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:43,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:43,430 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:43" (1/1) ... [2019-10-14 22:07:43,430 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:43" (1/1) ... [2019-10-14 22:07:43,445 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:43" (1/1) ... [2019-10-14 22:07:43,446 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:43" (1/1) ... [2019-10-14 22:07:43,461 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:43" (1/1) ... [2019-10-14 22:07:43,466 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:43" (1/1) ... [2019-10-14 22:07:43,470 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:43" (1/1) ... [2019-10-14 22:07:43,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:43,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:43,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:43,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:43,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:43" (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:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 22:07:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 22:07:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 22:07:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 22:07:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:44,040 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:44,040 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 22:07:44,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:44 BoogieIcfgContainer [2019-10-14 22:07:44,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:44,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:44,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:44,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:44,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:42" (1/3) ... [2019-10-14 22:07:44,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ee034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:44, skipping insertion in model container [2019-10-14 22:07:44,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:43" (2/3) ... [2019-10-14 22:07:44,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ee034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:44, skipping insertion in model container [2019-10-14 22:07:44,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:44" (3/3) ... [2019-10-14 22:07:44,049 INFO L109 eAbstractionObserver]: Analyzing ICFG calendar.i [2019-10-14 22:07:44,058 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:44,066 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 22:07:44,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 22:07:44,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:44,102 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:44,102 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:44,102 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:44,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:44,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:44,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:44,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-14 22:07:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:07:44,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:44,128 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:44,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:44,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:44,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2072180544, now seen corresponding path program 1 times [2019-10-14 22:07:44,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:44,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257108035] [2019-10-14 22:07:44,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:44,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:44,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:44,297 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:44,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257108035] [2019-10-14 22:07:44,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:44,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:07:44,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532669076] [2019-10-14 22:07:44,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:07:44,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:07:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:44,315 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2019-10-14 22:07:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:44,427 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-10-14 22:07:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:07:44,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 22:07:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:44,440 INFO L225 Difference]: With dead ends: 59 [2019-10-14 22:07:44,440 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 22:07:44,443 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:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 22:07:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-10-14 22:07:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 22:07:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-14 22:07:44,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 14 [2019-10-14 22:07:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:44,481 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-14 22:07:44,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:07:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-10-14 22:07:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 22:07:44,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:44,483 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:44,483 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash -868234929, now seen corresponding path program 1 times [2019-10-14 22:07:44,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:44,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133799674] [2019-10-14 22:07:44,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:44,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:44,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:44,617 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:44,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133799674] [2019-10-14 22:07:44,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:44,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:07:44,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564164143] [2019-10-14 22:07:44,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:07:44,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:07:44,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:07:44,623 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 5 states. [2019-10-14 22:07:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:44,782 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-14 22:07:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:07:44,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 22:07:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:44,783 INFO L225 Difference]: With dead ends: 39 [2019-10-14 22:07:44,783 INFO L226 Difference]: Without dead ends: 27 [2019-10-14 22:07:44,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-14 22:07:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-14 22:07:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 22:07:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-14 22:07:44,791 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2019-10-14 22:07:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:44,792 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-14 22:07:44,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:07:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-14 22:07:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:07:44,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:44,793 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:44,793 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash -899083565, now seen corresponding path program 1 times [2019-10-14 22:07:44,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:44,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714749186] [2019-10-14 22:07:44,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:44,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:44,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:45,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714749186] [2019-10-14 22:07:45,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:45,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:07:45,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654274994] [2019-10-14 22:07:45,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:07:45,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:07:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:45,068 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 9 states. [2019-10-14 22:07:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:45,771 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2019-10-14 22:07:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 22:07:45,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-14 22:07:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:45,774 INFO L225 Difference]: With dead ends: 82 [2019-10-14 22:07:45,775 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 22:07:45,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-10-14 22:07:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 22:07:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 31. [2019-10-14 22:07:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 22:07:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-10-14 22:07:45,788 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 21 [2019-10-14 22:07:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:45,788 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-14 22:07:45,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:07:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2019-10-14 22:07:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:07:45,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:45,790 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] [2019-10-14 22:07:45,792 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash -729273639, now seen corresponding path program 1 times [2019-10-14 22:07:45,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:45,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089024540] [2019-10-14 22:07:45,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:45,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:45,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 22:07:45,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089024540] [2019-10-14 22:07:45,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:45,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:45,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876614066] [2019-10-14 22:07:45,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:45,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:45,927 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 6 states. [2019-10-14 22:07:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:46,052 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-10-14 22:07:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:46,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-14 22:07:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:46,053 INFO L225 Difference]: With dead ends: 54 [2019-10-14 22:07:46,053 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 22:07:46,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 22:07:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-10-14 22:07:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 22:07:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-10-14 22:07:46,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2019-10-14 22:07:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:46,061 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-10-14 22:07:46,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2019-10-14 22:07:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:07:46,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:46,062 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] [2019-10-14 22:07:46,062 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:46,063 INFO L82 PathProgramCache]: Analyzing trace with hash -729214057, now seen corresponding path program 1 times [2019-10-14 22:07:46,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:46,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083039564] [2019-10-14 22:07:46,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 22:07:46,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083039564] [2019-10-14 22:07:46,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:46,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:07:46,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775080296] [2019-10-14 22:07:46,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:07:46,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:07:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:07:46,136 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 5 states. [2019-10-14 22:07:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:46,236 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-10-14 22:07:46,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:07:46,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-14 22:07:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:46,238 INFO L225 Difference]: With dead ends: 38 [2019-10-14 22:07:46,238 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 22:07:46,238 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:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 22:07:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-14 22:07:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 22:07:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-10-14 22:07:46,244 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 23 [2019-10-14 22:07:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:46,245 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-10-14 22:07:46,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:07:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-10-14 22:07:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:07:46,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:46,246 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] [2019-10-14 22:07:46,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1045733723, now seen corresponding path program 1 times [2019-10-14 22:07:46,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:46,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384493037] [2019-10-14 22:07:46,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:46,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384493037] [2019-10-14 22:07:46,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:46,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:07:46,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446987582] [2019-10-14 22:07:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:07:46,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:07:46,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:46,429 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 9 states. [2019-10-14 22:07:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:46,729 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-14 22:07:46,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:46,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-10-14 22:07:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:46,731 INFO L225 Difference]: With dead ends: 47 [2019-10-14 22:07:46,731 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 22:07:46,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-10-14 22:07:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 22:07:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-14 22:07:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 22:07:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-10-14 22:07:46,737 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 23 [2019-10-14 22:07:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:46,738 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-10-14 22:07:46,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:07:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-10-14 22:07:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:07:46,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:46,739 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:46,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:46,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1117039233, now seen corresponding path program 1 times [2019-10-14 22:07:46,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:46,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809501176] [2019-10-14 22:07:46,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:46,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809501176] [2019-10-14 22:07:46,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11076973] [2019-10-14 22:07:46,830 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:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 22:07:46,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:47,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:47,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:47,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-10-14 22:07:47,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:47,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:47,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-10-14 22:07:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:47,087 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:47,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-10-14 22:07:47,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708232786] [2019-10-14 22:07:47,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:47,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:47,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:47,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:47,090 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 7 states. [2019-10-14 22:07:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:47,269 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2019-10-14 22:07:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:47,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-10-14 22:07:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:47,272 INFO L225 Difference]: With dead ends: 72 [2019-10-14 22:07:47,272 INFO L226 Difference]: Without dead ends: 44 [2019-10-14 22:07:47,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-14 22:07:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-14 22:07:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 22:07:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-14 22:07:47,281 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 29 [2019-10-14 22:07:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:47,281 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-14 22:07:47,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-14 22:07:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 22:07:47,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:47,283 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:47,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:47,488 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2126291579, now seen corresponding path program 2 times [2019-10-14 22:07:47,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:47,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626883131] [2019-10-14 22:07:47,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:47,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626883131] [2019-10-14 22:07:47,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451749574] [2019-10-14 22:07:47,843 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 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:47,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:47,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:47,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 22:07:47,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:47,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:47,998 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 36 treesize of output 35 [2019-10-14 22:07:47,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,009 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 36 treesize of output 35 [2019-10-14 22:07:48,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-10-14 22:07:48,071 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-10-14 22:07:48,093 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:48,112 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:33 [2019-10-14 22:07:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,165 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 68 treesize of output 72 [2019-10-14 22:07:48,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,180 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 68 treesize of output 72 [2019-10-14 22:07:48,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,226 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_11|, |v_#memory_$Pointer$.base_11|], 14=[|v_#memory_int_12|]} [2019-10-14 22:07:48,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2019-10-14 22:07:48,236 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,243 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 62 treesize of output 58 [2019-10-14 22:07:48,244 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,294 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 58 treesize of output 54 [2019-10-14 22:07:48,294 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,302 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 58 treesize of output 54 [2019-10-14 22:07:48,303 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-10-14 22:07:48,406 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,427 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 54 treesize of output 50 [2019-10-14 22:07:48,428 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:48,460 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:137, output treesize:55 [2019-10-14 22:07:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-10-14 22:07:48,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-10-14 22:07:48,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-10-14 22:07:48,569 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-10-14 22:07:48,576 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:48,587 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:21 [2019-10-14 22:07:48,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:48,663 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:48,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2019-10-14 22:07:48,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043454366] [2019-10-14 22:07:48,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:07:48,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:48,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:07:48,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:48,665 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 19 states. [2019-10-14 22:07:49,229 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-10-14 22:07:49,395 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2019-10-14 22:07:49,590 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-10-14 22:07:49,748 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-10-14 22:07:49,895 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-10-14 22:07:50,072 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-10-14 22:07:50,378 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-10-14 22:07:50,518 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-10-14 22:07:50,648 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-10-14 22:07:50,783 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-10-14 22:07:50,926 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-10-14 22:07:51,175 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-10-14 22:07:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:52,744 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2019-10-14 22:07:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-14 22:07:52,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-10-14 22:07:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:52,748 INFO L225 Difference]: With dead ends: 140 [2019-10-14 22:07:52,748 INFO L226 Difference]: Without dead ends: 125 [2019-10-14 22:07:52,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=706, Invalid=2050, Unknown=0, NotChecked=0, Total=2756 [2019-10-14 22:07:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-14 22:07:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 52. [2019-10-14 22:07:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 22:07:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-10-14 22:07:52,770 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-10-14 22:07:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:52,770 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-10-14 22:07:52,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:07:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-10-14 22:07:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 22:07:52,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:52,772 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:52,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:52,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 738387715, now seen corresponding path program 1 times [2019-10-14 22:07:52,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:52,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695739358] [2019-10-14 22:07:52,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:53,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695739358] [2019-10-14 22:07:53,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359033613] [2019-10-14 22:07:53,322 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:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-14 22:07:53,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,465 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 39 treesize of output 38 [2019-10-14 22:07:53,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,476 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 39 treesize of output 38 [2019-10-14 22:07:53,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2019-10-14 22:07:53,527 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2019-10-14 22:07:53,550 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:53,579 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:39 [2019-10-14 22:07:53,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:53,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,610 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 69 treesize of output 73 [2019-10-14 22:07:53,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,624 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 68 treesize of output 72 [2019-10-14 22:07:53,625 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,634 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,635 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 68 treesize of output 72 [2019-10-14 22:07:53,636 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,718 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 12=[|v_#memory_int_14|]} [2019-10-14 22:07:53,727 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 63 treesize of output 59 [2019-10-14 22:07:53,728 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,740 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 62 treesize of output 58 [2019-10-14 22:07:53,741 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,749 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 62 treesize of output 58 [2019-10-14 22:07:53,750 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,828 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 59 treesize of output 55 [2019-10-14 22:07:53,829 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,836 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 58 treesize of output 54 [2019-10-14 22:07:53,836 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,841 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 58 treesize of output 54 [2019-10-14 22:07:53,842 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-10-14 22:07:53,944 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,987 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 55 treesize of output 51 [2019-10-14 22:07:53,988 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,011 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 54 treesize of output 50 [2019-10-14 22:07:54,012 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-14 22:07:54,064 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:206, output treesize:92 [2019-10-14 22:07:54,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:54,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-10-14 22:07:54,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-10-14 22:07:54,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-10-14 22:07:54,274 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2019-10-14 22:07:54,308 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-10-14 22:07:54,359 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-10-14 22:07:54,385 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-14 22:07:54,408 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:125, output treesize:35 [2019-10-14 22:07:54,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:54,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:54,475 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:54,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 17 [2019-10-14 22:07:54,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216447049] [2019-10-14 22:07:54,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:07:54,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:07:54,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:07:54,477 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-10-14 22:07:54,946 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-10-14 22:07:55,239 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-10-14 22:07:55,433 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-14 22:07:55,640 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-10-14 22:07:55,787 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-14 22:07:55,973 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-14 22:07:56,109 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-14 22:07:56,246 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-14 22:07:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:56,518 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2019-10-14 22:07:56,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:07:56,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-10-14 22:07:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:56,520 INFO L225 Difference]: With dead ends: 65 [2019-10-14 22:07:56,520 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 22:07:56,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2019-10-14 22:07:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 22:07:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2019-10-14 22:07:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 22:07:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2019-10-14 22:07:56,529 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 36 [2019-10-14 22:07:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:56,530 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2019-10-14 22:07:56,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:07:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2019-10-14 22:07:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 22:07:56,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:56,531 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:56,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:56,735 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash -173490905, now seen corresponding path program 3 times [2019-10-14 22:07:56,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:56,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824364592] [2019-10-14 22:07:56,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:56,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824364592] [2019-10-14 22:07:56,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654462376] [2019-10-14 22:07:56,947 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 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:57,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:07:57,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:57,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-14 22:07:57,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:57,093 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:57,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:57,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:57,123 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,133 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:57,133 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-10-14 22:07:57,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,162 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:57,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,228 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:57,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,277 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:57,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,312 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:57,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,341 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:57,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,364 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 29 treesize of output 36 [2019-10-14 22:07:57,364 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,402 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 29 treesize of output 36 [2019-10-14 22:07:57,403 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,431 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:126, output treesize:42 [2019-10-14 22:07:57,555 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-10-14 22:07:57,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:57,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:57,558 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:57,578 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-10-14 22:07:57,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-14 22:07:57,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2019-10-14 22:07:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,610 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:57,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-10-14 22:07:57,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109807328] [2019-10-14 22:07:57,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:57,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:57,612 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand 15 states. [2019-10-14 22:07:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:58,122 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2019-10-14 22:07:58,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 22:07:58,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-10-14 22:07:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:58,123 INFO L225 Difference]: With dead ends: 106 [2019-10-14 22:07:58,123 INFO L226 Difference]: Without dead ends: 65 [2019-10-14 22:07:58,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:07:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-14 22:07:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-10-14 22:07:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 22:07:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-10-14 22:07:58,131 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 42 [2019-10-14 22:07:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:58,131 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-10-14 22:07:58,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:07:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-10-14 22:07:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 22:07:58,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:58,133 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:58,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:58,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:58,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash -836408917, now seen corresponding path program 4 times [2019-10-14 22:07:58,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:58,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006484717] [2019-10-14 22:07:58,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:58,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:58,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:58,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006484717] [2019-10-14 22:07:58,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886551586] [2019-10-14 22:07:58,765 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 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:58,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 22:07:58,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:58,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-14 22:07:58,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:58,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,899 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 39 treesize of output 38 [2019-10-14 22:07:58,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,904 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 39 treesize of output 38 [2019-10-14 22:07:58,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [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:58,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2019-10-14 22:07:58,972 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:58,996 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:39 [2019-10-14 22:07:59,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,076 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 72 treesize of output 94 [2019-10-14 22:07:59,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,267 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-10-14 22:07:59,268 INFO L567 ElimStorePlain]: treesize reduction 14, result has 91.1 percent of original size [2019-10-14 22:07:59,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,323 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 72 treesize of output 94 [2019-10-14 22:07:59,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,500 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-10-14 22:07:59,500 INFO L567 ElimStorePlain]: treesize reduction 14, result has 91.0 percent of original size [2019-10-14 22:07:59,503 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8, |v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.offset_17|, v_prenex_13], 6=[v_prenex_9, |v_#memory_int_16|]} [2019-10-14 22:07:59,514 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 70 treesize of output 66 [2019-10-14 22:07:59,515 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,598 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 70 treesize of output 66 [2019-10-14 22:07:59,599 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,672 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 66 treesize of output 62 [2019-10-14 22:07:59,672 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,736 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 66 treesize of output 62 [2019-10-14 22:07:59,736 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,826 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 62 treesize of output 58 [2019-10-14 22:07:59,827 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,890 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 62 treesize of output 58 [2019-10-14 22:07:59,890 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:59,929 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 14 variables, input treesize:145, output treesize:85 [2019-10-14 22:07:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:00,055 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,056 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 170 treesize of output 180 [2019-10-14 22:08:00,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,088 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 170 treesize of output 180 [2019-10-14 22:08:00,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,424 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-14 22:08:00,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,427 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 12=[|v_#memory_int_17|]} [2019-10-14 22:08:00,436 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:00,442 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:00,735 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-14 22:08:00,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,744 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:08:00,750 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:00,948 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-14 22:08:00,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,955 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:08:00,964 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,141 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-14 22:08:01,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,150 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,159 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,283 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-14 22:08:01,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,332 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 107 treesize of output 106 [2019-10-14 22:08:01,334 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,370 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 107 treesize of output 106 [2019-10-14 22:08:01,371 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,492 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-14 22:08:01,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,521 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 111 treesize of output 118 [2019-10-14 22:08:01,521 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 118 [2019-10-14 22:08:01,542 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,670 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 115 treesize of output 111 [2019-10-14 22:08:01,671 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,699 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 115 treesize of output 111 [2019-10-14 22:08:01,700 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:08:01,777 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 12 variables, input treesize:341, output treesize:161 [2019-10-14 22:08:01,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,417 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 110 treesize of output 65 [2019-10-14 22:08:02,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,421 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:08:02,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,437 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 110 treesize of output 65 [2019-10-14 22:08:02,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,439 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:02,494 INFO L567 ElimStorePlain]: treesize reduction 32, result has 73.1 percent of original size [2019-10-14 22:08:02,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-14 22:08:02,499 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-14 22:08:02,503 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:08:02,533 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:221, output treesize:25 [2019-10-14 22:08:02,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:02,682 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:02,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2019-10-14 22:08:02,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898802920] [2019-10-14 22:08:02,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 22:08:02,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:02,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 22:08:02,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:08:02,687 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 23 states. [2019-10-14 22:08:03,446 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-14 22:08:03,592 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-10-14 22:08:03,842 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-10-14 22:08:04,175 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2019-10-14 22:08:04,525 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2019-10-14 22:08:04,831 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 95 [2019-10-14 22:08:05,099 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-10-14 22:08:05,408 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-10-14 22:08:05,678 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-10-14 22:08:06,031 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2019-10-14 22:08:06,324 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-10-14 22:08:06,596 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 92 [2019-10-14 22:08:06,890 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-10-14 22:08:07,168 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2019-10-14 22:08:07,446 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2019-10-14 22:08:07,754 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 113 [2019-10-14 22:08:08,048 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-10-14 22:08:08,340 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 106 [2019-10-14 22:08:08,603 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2019-10-14 22:08:08,888 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2019-10-14 22:08:09,139 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 106 [2019-10-14 22:08:09,464 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 111 [2019-10-14 22:08:09,732 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2019-10-14 22:08:10,004 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-10-14 22:08:10,281 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-10-14 22:08:10,570 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 106 [2019-10-14 22:08:10,780 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-14 22:08:10,995 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-10-14 22:08:11,176 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-14 22:08:11,363 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-14 22:08:11,557 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-14 22:08:11,751 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-10-14 22:08:11,928 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-14 22:08:12,153 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-10-14 22:08:12,343 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-14 22:08:12,527 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-10-14 22:08:12,704 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-10-14 22:08:12,899 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-10-14 22:08:13,080 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-10-14 22:08:13,244 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-14 22:08:13,405 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-10-14 22:08:13,599 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-14 22:08:13,756 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-14 22:08:13,920 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-14 22:08:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:13,922 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2019-10-14 22:08:13,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-14 22:08:13,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-10-14 22:08:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:13,924 INFO L225 Difference]: With dead ends: 173 [2019-10-14 22:08:13,924 INFO L226 Difference]: Without dead ends: 158 [2019-10-14 22:08:13,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1201, Invalid=3769, Unknown=0, NotChecked=0, Total=4970 [2019-10-14 22:08:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-14 22:08:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 68. [2019-10-14 22:08:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-14 22:08:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-10-14 22:08:13,939 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 47 [2019-10-14 22:08:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:13,940 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-10-14 22:08:13,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 22:08:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-10-14 22:08:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 22:08:13,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:13,941 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:14,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:14,145 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1146528307, now seen corresponding path program 2 times [2019-10-14 22:08:14,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:14,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287524452] [2019-10-14 22:08:14,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:14,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:14,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:14,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287524452] [2019-10-14 22:08:14,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975407067] [2019-10-14 22:08:14,608 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:08:14,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:08:14,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:14,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-14 22:08:14,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:14,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-10-14 22:08:14,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-10-14 22:08:14,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:08:14,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:29 [2019-10-14 22:08:14,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:14,881 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 65 treesize of output 64 [2019-10-14 22:08:14,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,892 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 65 treesize of output 64 [2019-10-14 22:08:14,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,969 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_32, |v_#memory_$Pointer$.offset_21|, v_prenex_35, |v_#memory_$Pointer$.base_21|], 6=[|v_#memory_int_19|, v_prenex_30]} [2019-10-14 22:08:14,978 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 64 treesize of output 60 [2019-10-14 22:08:14,979 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2019-10-14 22:08:15,067 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,142 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 60 treesize of output 56 [2019-10-14 22:08:15,142 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2019-10-14 22:08:15,202 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:15,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,296 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 1 case distinctions, treesize of input 56 treesize of output 68 [2019-10-14 22:08:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:15,297 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,391 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.2 percent of original size [2019-10-14 22:08:15,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:15,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,419 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 1 case distinctions, treesize of input 56 treesize of output 68 [2019-10-14 22:08:15,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:15,420 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,506 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.9 percent of original size [2019-10-14 22:08:15,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:08:15,507 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:131, output treesize:73 [2019-10-14 22:08:15,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:15,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:15,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:15,688 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,688 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 156 treesize of output 160 [2019-10-14 22:08:15,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,733 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 151 treesize of output 155 [2019-10-14 22:08:15,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:16,551 WARN L191 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-10-14 22:08:16,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:16,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:16,597 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 156 treesize of output 160 [2019-10-14 22:08:16,598 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,309 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-10-14 22:08:17,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:17,312 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_23|, v_prenex_43, v_prenex_36, |v_#memory_$Pointer$.offset_22|, v_prenex_46, v_prenex_45, |v_#memory_$Pointer$.offset_24|, v_prenex_44, |v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_22|, v_prenex_37], 6=[v_prenex_42, |v_#memory_int_20|]} [2019-10-14 22:08:17,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 129 [2019-10-14 22:08:17,370 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 134 [2019-10-14 22:08:17,407 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,993 WARN L191 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-10-14 22:08:17,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,007 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:18,022 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:08:18,623 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-10-14 22:08:18,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,638 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:19,182 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-10-14 22:08:19,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:19,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:19,250 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 136 treesize of output 124 [2019-10-14 22:08:19,251 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:19,658 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-10-14 22:08:19,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:19,667 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:19,674 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:20,110 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-10-14 22:08:20,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,119 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:20,536 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-10-14 22:08:20,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:20,573 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 107 treesize of output 95 [2019-10-14 22:08:20,574 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,911 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-10-14 22:08:20,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 87 [2019-10-14 22:08:20,942 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 82 [2019-10-14 22:08:20,965 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,242 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-14 22:08:21,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:21,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:21,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2019-10-14 22:08:21,276 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,485 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-10-14 22:08:21,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:21,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:21,513 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 84 treesize of output 87 [2019-10-14 22:08:21,514 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:21,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 82 [2019-10-14 22:08:21,541 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,700 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-14 22:08:21,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:21,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:21,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 87 [2019-10-14 22:08:21,727 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:21,742 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 79 treesize of output 82 [2019-10-14 22:08:21,743 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,864 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 22:08:21,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:21,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:21,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2019-10-14 22:08:21,884 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,996 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-14 22:08:21,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:22,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,010 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:22,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:22,029 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 1 case distinctions, treesize of input 84 treesize of output 108 [2019-10-14 22:08:22,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:22,031 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:22,230 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-10-14 22:08:22,230 INFO L567 ElimStorePlain]: treesize reduction 20, result has 92.6 percent of original size [2019-10-14 22:08:22,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:22,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:22,296 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 1 case distinctions, treesize of input 84 treesize of output 108 [2019-10-14 22:08:22,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:22,297 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:22,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2019-10-14 22:08:22,316 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:22,501 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-10-14 22:08:22,501 INFO L567 ElimStorePlain]: treesize reduction 20, result has 92.4 percent of original size [2019-10-14 22:08:22,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 14 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-14 22:08:22,503 INFO L221 ElimStorePlain]: Needed 25 recursive calls to eliminate 22 variables, input treesize:464, output treesize:162 [2019-10-14 22:08:22,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:23,299 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2019-10-14 22:08:23,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:23,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 72 [2019-10-14 22:08:23,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,420 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:08:23,439 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-14 22:08:23,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 75 [2019-10-14 22:08:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,441 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:23,505 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.0 percent of original size [2019-10-14 22:08:23,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2019-10-14 22:08:23,519 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2019-10-14 22:08:23,527 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,567 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 2 xjuncts. [2019-10-14 22:08:23,567 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:195, output treesize:61 [2019-10-14 22:08:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:23,838 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:23,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2019-10-14 22:08:23,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021422583] [2019-10-14 22:08:23,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-14 22:08:23,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:23,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-14 22:08:23,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2019-10-14 22:08:23,839 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 28 states.