java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:06:32,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:06:32,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:06:32,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:06:32,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:06:32,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:06:32,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:06:32,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:06:32,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:06:32,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:06:32,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:06:32,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:06:32,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:06:32,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:06:32,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:06:32,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:06:32,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:06:32,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:06:32,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:06:32,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:06:32,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:06:32,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:06:32,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:06:32,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:06:32,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:06:32,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:06:32,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:06:32,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:06:32,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:06:32,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:06:32,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:06:32,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:06:32,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:06:32,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:06:32,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:06:32,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:06:32,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:06:32,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:06:32,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:06:32,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:06:32,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:06:32,574 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:06:32,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:06:32,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:06:32,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:06:32,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:06:32,593 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:06:32,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:06:32,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:06:32,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:06:32,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:06:32,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:06:32,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:06:32,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:06:32,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:06:32,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:06:32,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:06:32,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:06:32,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:06:32,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:06:32,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:06:32,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:06:32,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:06:32,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:06:32,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:06:32,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:06:32,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:06:32,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:06:32,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:06:32,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:06:32,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:06:32,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:06:32,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:06:32,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:06:32,934 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:06:32,934 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:06:32,935 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-14 22:06:32,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f306c3b/a76bf299026e4028a4c1c4f2d089d2a0/FLAG5fbe042c9 [2019-10-14 22:06:33,488 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:06:33,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-14 22:06:33,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f306c3b/a76bf299026e4028a4c1c4f2d089d2a0/FLAG5fbe042c9 [2019-10-14 22:06:33,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f306c3b/a76bf299026e4028a4c1c4f2d089d2a0 [2019-10-14 22:06:33,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:06:33,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:06:33,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:33,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:06:33,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:06:33,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:33" (1/1) ... [2019-10-14 22:06:33,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:33, skipping insertion in model container [2019-10-14 22:06:33,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:33" (1/1) ... [2019-10-14 22:06:33,873 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:06:33,929 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:06:34,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:34,434 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:06:34,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:34,559 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:06:34,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34 WrapperNode [2019-10-14 22:06:34,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:34,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:06:34,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:06:34,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:06:34,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (1/1) ... [2019-10-14 22:06:34,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (1/1) ... [2019-10-14 22:06:34,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (1/1) ... [2019-10-14 22:06:34,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (1/1) ... [2019-10-14 22:06:34,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (1/1) ... [2019-10-14 22:06:34,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (1/1) ... [2019-10-14 22:06:34,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (1/1) ... [2019-10-14 22:06:34,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:06:34,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:06:34,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:06:34,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:06:34,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (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:06:34,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:06:34,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:06:34,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:06:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:06:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:06:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:06:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:06:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:06:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:06:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:06:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:06:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:06:34,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:06:34,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:06:34,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:06:34,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:06:34,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:06:34,705 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:06:34,706 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:06:34,706 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:06:34,706 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:06:34,706 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:06:34,706 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:06:34,706 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:06:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:06:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:06:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:06:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:06:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:06:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:06:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:06:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:06:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:06:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:06:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:06:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:06:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:06:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:06:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:06:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:06:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:06:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:06:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:06:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:06:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:06:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:06:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:06:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:06:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:06:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:06:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:06:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:06:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:06:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:06:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:06:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:06:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:06:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:06:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:06:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:06:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:06:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:06:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:06:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:06:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:06:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:06:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:06:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:06:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:06:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:06:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:06:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:06:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:06:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:06:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:06:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:06:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:06:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:06:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:06:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:06:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:06:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:06:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:06:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:06:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:06:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:06:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:06:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:06:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:06:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:06:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:06:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:06:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:06:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:06:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:06:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:06:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:06:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:06:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:06:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:06:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:06:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:06:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:06:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:06:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:06:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:06:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:06:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:06:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:06:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:06:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:06:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:06:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:06:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:06:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:06:35,413 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:06:35,413 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-14 22:06:35,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:35 BoogieIcfgContainer [2019-10-14 22:06:35,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:06:35,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:06:35,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:06:35,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:06:35,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:06:33" (1/3) ... [2019-10-14 22:06:35,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d39021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:35, skipping insertion in model container [2019-10-14 22:06:35,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:34" (2/3) ... [2019-10-14 22:06:35,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d39021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:35, skipping insertion in model container [2019-10-14 22:06:35,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:35" (3/3) ... [2019-10-14 22:06:35,424 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-10-14 22:06:35,433 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:06:35,440 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-14 22:06:35,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-14 22:06:35,475 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:06:35,475 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:06:35,476 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:06:35,476 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:06:35,476 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:06:35,476 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:06:35,477 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:06:35,477 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:06:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-10-14 22:06:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-14 22:06:35,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:35,504 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:35,506 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:35,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-10-14 22:06:35,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:35,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938718312] [2019-10-14 22:06:35,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:35,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:35,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:35,699 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:06:35,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938718312] [2019-10-14 22:06:35,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:35,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:35,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221261894] [2019-10-14 22:06:35,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:35,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:35,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:35,740 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2019-10-14 22:06:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:36,008 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-10-14 22:06:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:36,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-14 22:06:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:36,020 INFO L225 Difference]: With dead ends: 186 [2019-10-14 22:06:36,020 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 22:06:36,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 22:06:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-10-14 22:06:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 22:06:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-14 22:06:36,068 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-10-14 22:06:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:36,068 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-14 22:06:36,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-14 22:06:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:06:36,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:36,069 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:36,070 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:36,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-10-14 22:06:36,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:36,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409087809] [2019-10-14 22:06:36,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,142 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:06:36,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409087809] [2019-10-14 22:06:36,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:36,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:36,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57406008] [2019-10-14 22:06:36,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:36,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:36,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:36,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:36,145 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 4 states. [2019-10-14 22:06:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:36,291 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-14 22:06:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:36,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 22:06:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:36,293 INFO L225 Difference]: With dead ends: 84 [2019-10-14 22:06:36,293 INFO L226 Difference]: Without dead ends: 82 [2019-10-14 22:06:36,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-14 22:06:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-10-14 22:06:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-14 22:06:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-10-14 22:06:36,319 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-10-14 22:06:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:36,320 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-10-14 22:06:36,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-10-14 22:06:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:06:36,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:36,321 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:36,322 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-10-14 22:06:36,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:36,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99232626] [2019-10-14 22:06:36,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,422 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:06:36,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99232626] [2019-10-14 22:06:36,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:36,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:36,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429306320] [2019-10-14 22:06:36,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:36,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:36,424 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 5 states. [2019-10-14 22:06:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:36,598 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-14 22:06:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:36,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-14 22:06:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:36,600 INFO L225 Difference]: With dead ends: 84 [2019-10-14 22:06:36,601 INFO L226 Difference]: Without dead ends: 82 [2019-10-14 22:06:36,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-14 22:06:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-10-14 22:06:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-14 22:06:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-10-14 22:06:36,615 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-10-14 22:06:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:36,616 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-10-14 22:06:36,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-10-14 22:06:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 22:06:36,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:36,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:36,618 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:36,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:36,621 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-10-14 22:06:36,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:36,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208520724] [2019-10-14 22:06:36,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,730 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:06:36,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208520724] [2019-10-14 22:06:36,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:36,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:36,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413700199] [2019-10-14 22:06:36,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:36,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:36,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:36,734 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 5 states. [2019-10-14 22:06:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:36,977 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2019-10-14 22:06:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:36,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-14 22:06:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:36,979 INFO L225 Difference]: With dead ends: 199 [2019-10-14 22:06:36,980 INFO L226 Difference]: Without dead ends: 132 [2019-10-14 22:06:36,981 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:06:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-14 22:06:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-10-14 22:06:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 22:06:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-14 22:06:36,991 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2019-10-14 22:06:36,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:36,991 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-14 22:06:36,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-14 22:06:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 22:06:36,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:36,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:36,995 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2019-10-14 22:06:36,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:36,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430206334] [2019-10-14 22:06:36,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,178 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:06:37,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430206334] [2019-10-14 22:06:37,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:37,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:06:37,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391238762] [2019-10-14 22:06:37,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:06:37,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:06:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:37,182 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 6 states. [2019-10-14 22:06:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:37,414 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-10-14 22:06:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:06:37,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-14 22:06:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:37,416 INFO L225 Difference]: With dead ends: 126 [2019-10-14 22:06:37,416 INFO L226 Difference]: Without dead ends: 122 [2019-10-14 22:06:37,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:06:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-14 22:06:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-10-14 22:06:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-14 22:06:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-10-14 22:06:37,438 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2019-10-14 22:06:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:37,439 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-10-14 22:06:37,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:06:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-10-14 22:06:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:06:37,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:37,443 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:37,443 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2019-10-14 22:06:37,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:37,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75930962] [2019-10-14 22:06:37,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,512 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:06:37,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75930962] [2019-10-14 22:06:37,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:37,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:06:37,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513452794] [2019-10-14 22:06:37,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:06:37,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:06:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:37,515 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 6 states. [2019-10-14 22:06:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:37,676 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-10-14 22:06:37,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:37,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-14 22:06:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:37,678 INFO L225 Difference]: With dead ends: 136 [2019-10-14 22:06:37,678 INFO L226 Difference]: Without dead ends: 116 [2019-10-14 22:06:37,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:06:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-14 22:06:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2019-10-14 22:06:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-14 22:06:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-10-14 22:06:37,686 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2019-10-14 22:06:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:37,686 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-10-14 22:06:37,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:06:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-10-14 22:06:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 22:06:37,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:37,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:37,688 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2019-10-14 22:06:37,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:37,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474712334] [2019-10-14 22:06:37,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,728 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:06:37,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474712334] [2019-10-14 22:06:37,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:37,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:37,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318764993] [2019-10-14 22:06:37,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:37,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:37,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:37,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:37,730 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 4 states. [2019-10-14 22:06:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:37,868 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-10-14 22:06:37,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:37,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-14 22:06:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:37,870 INFO L225 Difference]: With dead ends: 141 [2019-10-14 22:06:37,870 INFO L226 Difference]: Without dead ends: 100 [2019-10-14 22:06:37,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-14 22:06:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-10-14 22:06:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-14 22:06:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-10-14 22:06:37,879 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2019-10-14 22:06:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:37,879 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-10-14 22:06:37,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-10-14 22:06:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:06:37,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:37,880 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:37,881 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2019-10-14 22:06:37,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:37,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438426740] [2019-10-14 22:06:37,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,917 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:06:37,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438426740] [2019-10-14 22:06:37,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:37,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:37,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624089902] [2019-10-14 22:06:37,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:37,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:37,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:37,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:37,919 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-10-14 22:06:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:38,030 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2019-10-14 22:06:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:38,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-10-14 22:06:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:38,032 INFO L225 Difference]: With dead ends: 79 [2019-10-14 22:06:38,032 INFO L226 Difference]: Without dead ends: 77 [2019-10-14 22:06:38,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-14 22:06:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-14 22:06:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-14 22:06:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-14 22:06:38,038 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2019-10-14 22:06:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:38,038 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-14 22:06:38,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-10-14 22:06:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:06:38,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:38,039 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:38,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:38,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2019-10-14 22:06:38,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:38,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002194855] [2019-10-14 22:06:38,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,109 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:06:38,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002194855] [2019-10-14 22:06:38,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:38,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:38,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975982251] [2019-10-14 22:06:38,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:38,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:38,112 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2019-10-14 22:06:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:38,273 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-10-14 22:06:38,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:38,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-14 22:06:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:38,275 INFO L225 Difference]: With dead ends: 78 [2019-10-14 22:06:38,275 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 22:06:38,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 22:06:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-14 22:06:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 22:06:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-14 22:06:38,281 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2019-10-14 22:06:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:38,281 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-14 22:06:38,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-14 22:06:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 22:06:38,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:38,282 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:38,283 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:38,283 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-10-14 22:06:38,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:38,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992910368] [2019-10-14 22:06:38,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,379 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:06:38,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992910368] [2019-10-14 22:06:38,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:38,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:06:38,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145386414] [2019-10-14 22:06:38,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:06:38,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:06:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:06:38,381 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 7 states. [2019-10-14 22:06:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:38,699 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-10-14 22:06:38,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:06:38,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-10-14 22:06:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:38,701 INFO L225 Difference]: With dead ends: 179 [2019-10-14 22:06:38,701 INFO L226 Difference]: Without dead ends: 137 [2019-10-14 22:06:38,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:06:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-14 22:06:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-10-14 22:06:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-14 22:06:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-10-14 22:06:38,708 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-10-14 22:06:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:38,708 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-10-14 22:06:38,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:06:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-10-14 22:06:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 22:06:38,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:38,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:38,710 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-10-14 22:06:38,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:38,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216352431] [2019-10-14 22:06:38,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,942 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:06:38,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216352431] [2019-10-14 22:06:38,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:38,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 22:06:38,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795852532] [2019-10-14 22:06:38,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 22:06:38,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 22:06:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:06:38,944 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 10 states. [2019-10-14 22:06:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:39,877 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-10-14 22:06:39,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 22:06:39,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-10-14 22:06:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:39,880 INFO L225 Difference]: With dead ends: 175 [2019-10-14 22:06:39,881 INFO L226 Difference]: Without dead ends: 173 [2019-10-14 22:06:39,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:06:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-14 22:06:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 104. [2019-10-14 22:06:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-14 22:06:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-10-14 22:06:39,889 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-10-14 22:06:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:39,889 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-10-14 22:06:39,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 22:06:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-10-14 22:06:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 22:06:39,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:39,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:39,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-10-14 22:06:39,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:39,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139276983] [2019-10-14 22:06:39,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:39,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:39,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:06:39,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139276983] [2019-10-14 22:06:39,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:39,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:06:39,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678213303] [2019-10-14 22:06:39,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:06:39,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:06:39,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:39,952 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 6 states. [2019-10-14 22:06:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:40,149 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2019-10-14 22:06:40,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:06:40,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-14 22:06:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:40,150 INFO L225 Difference]: With dead ends: 151 [2019-10-14 22:06:40,150 INFO L226 Difference]: Without dead ends: 133 [2019-10-14 22:06:40,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:06:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-14 22:06:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-10-14 22:06:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-14 22:06:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-10-14 22:06:40,159 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-10-14 22:06:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:40,160 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-10-14 22:06:40,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:06:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-10-14 22:06:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 22:06:40,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:40,161 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:40,162 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-10-14 22:06:40,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:40,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452375546] [2019-10-14 22:06:40,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:40,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:40,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:06:40,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452375546] [2019-10-14 22:06:40,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:40,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:40,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423283416] [2019-10-14 22:06:40,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:40,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:40,205 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 4 states. [2019-10-14 22:06:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:40,346 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-10-14 22:06:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:40,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 22:06:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:40,348 INFO L225 Difference]: With dead ends: 125 [2019-10-14 22:06:40,348 INFO L226 Difference]: Without dead ends: 123 [2019-10-14 22:06:40,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-14 22:06:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-10-14 22:06:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-14 22:06:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-10-14 22:06:40,356 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-10-14 22:06:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:40,357 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-10-14 22:06:40,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-10-14 22:06:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 22:06:40,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:40,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:40,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-10-14 22:06:40,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:40,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597816479] [2019-10-14 22:06:40,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:40,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:40,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:40,571 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:06:40,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597816479] [2019-10-14 22:06:40,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:40,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 22:06:40,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858687424] [2019-10-14 22:06:40,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 22:06:40,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:40,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 22:06:40,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:06:40,573 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 10 states. [2019-10-14 22:06:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:41,260 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-10-14 22:06:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 22:06:41,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-10-14 22:06:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:41,261 INFO L225 Difference]: With dead ends: 201 [2019-10-14 22:06:41,262 INFO L226 Difference]: Without dead ends: 199 [2019-10-14 22:06:41,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:06:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-14 22:06:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 129. [2019-10-14 22:06:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-14 22:06:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-10-14 22:06:41,271 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-10-14 22:06:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:41,271 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-10-14 22:06:41,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 22:06:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-10-14 22:06:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 22:06:41,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:41,273 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:41,273 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-10-14 22:06:41,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:41,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436598484] [2019-10-14 22:06:41,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:41,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:41,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436598484] [2019-10-14 22:06:41,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773530476] [2019-10-14 22:06:41,355 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:06:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:41,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 22:06:41,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:41,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,557 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 16 treesize of output 17 [2019-10-14 22:06:41,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,585 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 16 treesize of output 17 [2019-10-14 22:06:41,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:36 [2019-10-14 22:06:41,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-14 22:06:41,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:41,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-14 22:06:41,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-10-14 22:06:41,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 22:06:41,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 22:06:41,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,767 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:06:41,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-10-14 22:06:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:41,775 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:41,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-10-14 22:06:41,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112855579] [2019-10-14 22:06:41,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:06:41,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:41,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:06:41,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:06:41,777 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 9 states. [2019-10-14 22:06:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:42,218 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2019-10-14 22:06:42,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 22:06:42,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-10-14 22:06:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:42,220 INFO L225 Difference]: With dead ends: 220 [2019-10-14 22:06:42,220 INFO L226 Difference]: Without dead ends: 160 [2019-10-14 22:06:42,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:06:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-14 22:06:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2019-10-14 22:06:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-14 22:06:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-10-14 22:06:42,229 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2019-10-14 22:06:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:42,229 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-10-14 22:06:42,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:06:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-10-14 22:06:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 22:06:42,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:42,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:42,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:42,432 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2072098386, now seen corresponding path program 1 times [2019-10-14 22:06:42,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:42,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987992792] [2019-10-14 22:06:42,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:42,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:42,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:42,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987992792] [2019-10-14 22:06:42,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:42,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:06:42,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889874962] [2019-10-14 22:06:42,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:06:42,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:42,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:06:42,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:06:42,613 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 7 states. [2019-10-14 22:06:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:42,961 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2019-10-14 22:06:42,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:06:42,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-10-14 22:06:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:42,963 INFO L225 Difference]: With dead ends: 161 [2019-10-14 22:06:42,963 INFO L226 Difference]: Without dead ends: 141 [2019-10-14 22:06:42,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:06:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-14 22:06:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2019-10-14 22:06:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-14 22:06:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-10-14 22:06:42,972 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 33 [2019-10-14 22:06:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:42,972 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-10-14 22:06:42,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:06:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-10-14 22:06:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 22:06:42,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:42,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:42,974 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1941174974, now seen corresponding path program 1 times [2019-10-14 22:06:42,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:42,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558429683] [2019-10-14 22:06:42,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:42,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:42,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:43,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558429683] [2019-10-14 22:06:43,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:43,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:43,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496608220] [2019-10-14 22:06:43,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:43,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:43,069 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 4 states. [2019-10-14 22:06:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:43,200 INFO L93 Difference]: Finished difference Result 224 states and 258 transitions. [2019-10-14 22:06:43,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:43,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-14 22:06:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:43,202 INFO L225 Difference]: With dead ends: 224 [2019-10-14 22:06:43,202 INFO L226 Difference]: Without dead ends: 169 [2019-10-14 22:06:43,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-14 22:06:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2019-10-14 22:06:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-14 22:06:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2019-10-14 22:06:43,217 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 35 [2019-10-14 22:06:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:43,218 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2019-10-14 22:06:43,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2019-10-14 22:06:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 22:06:43,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:43,219 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:43,220 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 930038423, now seen corresponding path program 1 times [2019-10-14 22:06:43,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:43,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846233611] [2019-10-14 22:06:43,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:43,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:43,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:43,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846233611] [2019-10-14 22:06:43,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974038292] [2019-10-14 22:06:43,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:43,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 22:06:43,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:43,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:06:43,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:43,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:43,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:06:43,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:43,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:43,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:43,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-10-14 22:06:43,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:43,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-14 22:06:43,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:43,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:43,597 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-14 22:06:43,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-10-14 22:06:43,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:43,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:43,602 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:06:43,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-14 22:06:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:43,608 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:43,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-10-14 22:06:43,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672210449] [2019-10-14 22:06:43,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 22:06:43,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:43,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 22:06:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:06:43,609 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 11 states. [2019-10-14 22:06:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:44,110 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2019-10-14 22:06:44,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 22:06:44,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-10-14 22:06:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:44,112 INFO L225 Difference]: With dead ends: 268 [2019-10-14 22:06:44,112 INFO L226 Difference]: Without dead ends: 224 [2019-10-14 22:06:44,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:06:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-14 22:06:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2019-10-14 22:06:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-14 22:06:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2019-10-14 22:06:44,123 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 36 [2019-10-14 22:06:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:44,123 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2019-10-14 22:06:44,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 22:06:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2019-10-14 22:06:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 22:06:44,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:44,124 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:44,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:44,328 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1341973316, now seen corresponding path program 1 times [2019-10-14 22:06:44,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:44,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770572843] [2019-10-14 22:06:44,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:44,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:44,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770572843] [2019-10-14 22:06:44,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183906787] [2019-10-14 22:06:44,614 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:06:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:44,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 22:06:44,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:44,720 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:06:44,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:44,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:44,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:44,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:06:44,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:06:44,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:44,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:44,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:06:44,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:44,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:44,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:44,761 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-10-14 22:06:44,816 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:44,817 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:06:44,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:44,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:44,864 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_41|], 16=[|v_#memory_$Pointer$.base_41|]} [2019-10-14 22:06:44,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:44,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:44,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:44,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:44,893 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 1 case distinctions, treesize of input 73 treesize of output 58 [2019-10-14 22:06:44,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:44,961 INFO L567 ElimStorePlain]: treesize reduction 22, result has 86.8 percent of original size [2019-10-14 22:06:44,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:45,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:45,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:45,062 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 3 case distinctions, treesize of input 76 treesize of output 123 [2019-10-14 22:06:45,064 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:45,143 INFO L567 ElimStorePlain]: treesize reduction 78, result has 50.9 percent of original size [2019-10-14 22:06:45,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:45,145 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:191, output treesize:95 [2019-10-14 22:06:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:45,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:45,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:45,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 227 [2019-10-14 22:06:45,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:45,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:45,480 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-10-14 22:06:45,480 INFO L341 Elim1Store]: treesize reduction 60, result has 74.5 percent of original size [2019-10-14 22:06:45,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 245 [2019-10-14 22:06:45,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:45,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:45,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:45,779 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-10-14 22:06:45,779 INFO L567 ElimStorePlain]: treesize reduction 1421, result has 15.2 percent of original size [2019-10-14 22:06:45,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:45,965 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-14 22:06:45,966 INFO L341 Elim1Store]: treesize reduction 66, result has 72.6 percent of original size [2019-10-14 22:06:45,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 267 [2019-10-14 22:06:45,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:45,990 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:06:46,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:46,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:46,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 225 [2019-10-14 22:06:46,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:46,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:46,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:46,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,124 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:46,379 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2019-10-14 22:06:46,379 INFO L567 ElimStorePlain]: treesize reduction 1107, result has 16.5 percent of original size [2019-10-14 22:06:46,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-14 22:06:46,382 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:260, output treesize:223 [2019-10-14 22:06:46,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,907 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-14 22:06:46,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:46,922 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_2, v_prenex_3, v_prenex_5, v_prenex_6], 18=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-10-14 22:06:46,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:46,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:46,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-10-14 22:06:46,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:46,965 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:06:47,102 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2019-10-14 22:06:47,102 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.3 percent of original size [2019-10-14 22:06:47,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:47,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-10-14 22:06:47,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:47,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:47,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:47,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:47,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-10-14 22:06:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,233 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:06:47,338 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-14 22:06:47,338 INFO L567 ElimStorePlain]: treesize reduction 36, result has 83.3 percent of original size [2019-10-14 22:06:47,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:47,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-10-14 22:06:47,347 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:47,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:47,538 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-14 22:06:47,538 INFO L341 Elim1Store]: treesize reduction 10, result has 92.2 percent of original size [2019-10-14 22:06:47,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 184 [2019-10-14 22:06:47,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,599 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:06:47,703 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-10-14 22:06:47,703 INFO L567 ElimStorePlain]: treesize reduction 88, result has 54.2 percent of original size [2019-10-14 22:06:47,727 INFO L341 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2019-10-14 22:06:47,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 68 [2019-10-14 22:06:47,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:47,730 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:47,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:47,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:47,749 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:330, output treesize:7 [2019-10-14 22:06:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:47,765 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:47,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-14 22:06:47,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222998633] [2019-10-14 22:06:47,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:06:47,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:47,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:06:47,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=1, NotChecked=0, Total=182 [2019-10-14 22:06:47,766 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 14 states. [2019-10-14 22:06:48,212 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-10-14 22:06:48,878 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-10-14 22:06:49,145 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2019-10-14 22:06:49,400 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-14 22:06:49,570 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-14 22:06:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:49,977 INFO L93 Difference]: Finished difference Result 449 states and 525 transitions. [2019-10-14 22:06:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 22:06:49,978 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-10-14 22:06:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:49,981 INFO L225 Difference]: With dead ends: 449 [2019-10-14 22:06:49,981 INFO L226 Difference]: Without dead ends: 361 [2019-10-14 22:06:49,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=195, Invalid=614, Unknown=3, NotChecked=0, Total=812 [2019-10-14 22:06:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-14 22:06:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 191. [2019-10-14 22:06:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-14 22:06:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2019-10-14 22:06:49,994 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 40 [2019-10-14 22:06:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:49,995 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2019-10-14 22:06:49,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 22:06:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2019-10-14 22:06:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 22:06:49,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:49,996 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:50,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:50,200 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:50,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:50,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2026576836, now seen corresponding path program 1 times [2019-10-14 22:06:50,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:50,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233706342] [2019-10-14 22:06:50,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:50,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:50,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:50,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233706342] [2019-10-14 22:06:50,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267989880] [2019-10-14 22:06:50,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:50,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-14 22:06:50,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:50,919 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:06:50,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:50,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:50,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:50,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:06:50,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:50,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:06:50,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,054 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-10-14 22:06:51,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,063 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:51,074 INFO L341 Elim1Store]: treesize reduction 87, result has 9.4 percent of original size [2019-10-14 22:06:51,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 193 [2019-10-14 22:06:51,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:51,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-10-14 22:06:51,107 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:51,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,129 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-10-14 22:06:51,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:51,265 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 22 treesize of output 32 [2019-10-14 22:06:51,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:51,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:51,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:51,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-10-14 22:06:51,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,472 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-14 22:06:51,473 INFO L567 ElimStorePlain]: treesize reduction 16, result has 92.7 percent of original size [2019-10-14 22:06:51,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:51,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:51,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-10-14 22:06:51,529 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,711 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-14 22:06:51,711 INFO L567 ElimStorePlain]: treesize reduction 132, result has 49.0 percent of original size [2019-10-14 22:06:51,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:51,712 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-10-14 22:06:51,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:51,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:51,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:51,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-10-14 22:06:51,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:51,851 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:06:52,000 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-10-14 22:06:52,000 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-10-14 22:06:52,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:52,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:52,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:52,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-10-14 22:06:52,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:52,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:52,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:52,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-10-14 22:06:52,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:52,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:52,522 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-10-14 22:06:52,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 165 treesize of output 132 [2019-10-14 22:06:52,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:52,533 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:52,602 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-10-14 22:06:52,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:52,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 46 [2019-10-14 22:06:52,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:52,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:52,627 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:06:52,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:7 [2019-10-14 22:06:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:52,649 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:52,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-10-14 22:06:52,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983129067] [2019-10-14 22:06:52,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 22:06:52,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 22:06:52,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:06:52,650 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand 20 states. [2019-10-14 22:06:53,464 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-14 22:06:53,885 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-14 22:06:54,068 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-10-14 22:06:54,313 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-10-14 22:06:54,589 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2019-10-14 22:06:54,808 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-10-14 22:06:54,939 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-14 22:06:55,358 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-10-14 22:06:55,710 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-10-14 22:06:55,976 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-10-14 22:06:56,248 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-10-14 22:06:56,624 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-14 22:06:57,272 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-14 22:06:57,606 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-14 22:06:57,914 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-14 22:06:58,271 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-14 22:06:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:58,446 INFO L93 Difference]: Finished difference Result 752 states and 865 transitions. [2019-10-14 22:06:58,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-14 22:06:58,449 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-10-14 22:06:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:58,453 INFO L225 Difference]: With dead ends: 752 [2019-10-14 22:06:58,453 INFO L226 Difference]: Without dead ends: 750 [2019-10-14 22:06:58,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2019-10-14 22:06:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-10-14 22:06:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 225. [2019-10-14 22:06:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-14 22:06:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2019-10-14 22:06:58,473 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 40 [2019-10-14 22:06:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:58,473 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2019-10-14 22:06:58,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 22:06:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2019-10-14 22:06:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 22:06:58,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:58,475 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:58,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:58,679 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1168199972, now seen corresponding path program 1 times [2019-10-14 22:06:58,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:58,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846062154] [2019-10-14 22:06:58,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:58,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:58,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:58,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846062154] [2019-10-14 22:06:58,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:58,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:06:58,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899687884] [2019-10-14 22:06:58,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:06:58,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:58,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:06:58,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:58,741 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 6 states. [2019-10-14 22:06:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:58,895 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2019-10-14 22:06:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:06:58,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-14 22:06:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:58,897 INFO L225 Difference]: With dead ends: 291 [2019-10-14 22:06:58,897 INFO L226 Difference]: Without dead ends: 177 [2019-10-14 22:06:58,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-14 22:06:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-10-14 22:06:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-14 22:06:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-10-14 22:06:58,910 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 42 [2019-10-14 22:06:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:58,910 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-10-14 22:06:58,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:06:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-10-14 22:06:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 22:06:58,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:58,911 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:58,911 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash 608870837, now seen corresponding path program 1 times [2019-10-14 22:06:58,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:58,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864817015] [2019-10-14 22:06:58,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:58,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:58,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:59,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864817015] [2019-10-14 22:06:59,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141818647] [2019-10-14 22:06:59,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:59,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-14 22:06:59,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:59,532 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:06:59,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:06:59,572 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:06:59,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,636 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-10-14 22:06:59,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,657 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-10-14 22:06:59,657 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 1 case distinctions, treesize of input 141 treesize of output 130 [2019-10-14 22:06:59,658 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-10-14 22:06:59,687 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,708 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-10-14 22:06:59,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,825 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 22 treesize of output 32 [2019-10-14 22:06:59,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:59,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,922 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:59,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:59,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:06:59,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:59,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-10-14 22:06:59,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,117 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-10-14 22:07:00,117 INFO L567 ElimStorePlain]: treesize reduction 132, result has 59.4 percent of original size [2019-10-14 22:07:00,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-10-14 22:07:00,158 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,239 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.8 percent of original size [2019-10-14 22:07:00,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,240 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-10-14 22:07:00,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:00,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-10-14 22:07:00,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,373 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:00,499 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-10-14 22:07:00,500 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-10-14 22:07:00,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-10-14 22:07:00,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-10-14 22:07:00,935 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-10-14 22:07:00,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 161 treesize of output 130 [2019-10-14 22:07:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:00,955 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:01,029 INFO L567 ElimStorePlain]: treesize reduction 32, result has 71.4 percent of original size [2019-10-14 22:07:01,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:01,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2019-10-14 22:07:01,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:01,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:01,054 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:01,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:7 [2019-10-14 22:07:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:01,096 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:01,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-10-14 22:07:01,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998524396] [2019-10-14 22:07:01,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 22:07:01,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 22:07:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:07:01,098 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 20 states. [2019-10-14 22:07:01,702 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-14 22:07:02,101 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-14 22:07:02,806 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-10-14 22:07:03,210 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:07:03,503 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 111 [2019-10-14 22:07:03,707 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-10-14 22:07:04,206 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2019-10-14 22:07:04,529 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-10-14 22:07:04,796 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-10-14 22:07:05,133 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-10-14 22:07:05,380 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-10-14 22:07:05,690 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-10-14 22:07:06,221 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-10-14 22:07:06,366 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-14 22:07:06,739 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-14 22:07:07,030 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-10-14 22:07:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:07,546 INFO L93 Difference]: Finished difference Result 579 states and 633 transitions. [2019-10-14 22:07:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-14 22:07:07,546 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-10-14 22:07:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:07,549 INFO L225 Difference]: With dead ends: 579 [2019-10-14 22:07:07,549 INFO L226 Difference]: Without dead ends: 577 [2019-10-14 22:07:07,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=664, Invalid=1988, Unknown=0, NotChecked=0, Total=2652 [2019-10-14 22:07:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-14 22:07:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 203. [2019-10-14 22:07:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-14 22:07:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 233 transitions. [2019-10-14 22:07:07,567 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 233 transitions. Word has length 43 [2019-10-14 22:07:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:07,567 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 233 transitions. [2019-10-14 22:07:07,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 22:07:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 233 transitions. [2019-10-14 22:07:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 22:07:07,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:07,568 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:07,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:07,770 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:07,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash 938403788, now seen corresponding path program 1 times [2019-10-14 22:07:07,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:07,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414617060] [2019-10-14 22:07:07,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:07,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:07,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:08,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414617060] [2019-10-14 22:07:08,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786343489] [2019-10-14 22:07:08,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 22:07:08,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:08,699 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,700 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 54 [2019-10-14 22:07:08,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:08,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:08,702 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:08,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:08,919 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-14 22:07:08,924 INFO L168 Benchmark]: Toolchain (without parser) took 35066.89 ms. Allocated memory was 143.1 MB in the beginning and 480.2 MB in the end (delta: 337.1 MB). Free memory was 101.6 MB in the beginning and 303.0 MB in the end (delta: -201.4 MB). Peak memory consumption was 135.7 MB. Max. memory is 7.1 GB. [2019-10-14 22:07:08,925 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 143.1 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 22:07:08,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.16 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 101.4 MB in the beginning and 168.9 MB in the end (delta: -67.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-10-14 22:07:08,925 INFO L168 Benchmark]: Boogie Preprocessor took 76.68 ms. Allocated memory is still 202.9 MB. Free memory was 168.9 MB in the beginning and 165.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-14 22:07:08,926 INFO L168 Benchmark]: RCFGBuilder took 773.45 ms. Allocated memory is still 202.9 MB. Free memory was 165.5 MB in the beginning and 110.4 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-10-14 22:07:08,927 INFO L168 Benchmark]: TraceAbstraction took 33506.56 ms. Allocated memory was 202.9 MB in the beginning and 480.2 MB in the end (delta: 277.3 MB). Free memory was 110.4 MB in the beginning and 303.0 MB in the end (delta: -192.5 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-10-14 22:07:08,928 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 143.1 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 702.16 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 101.4 MB in the beginning and 168.9 MB in the end (delta: -67.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.68 ms. Allocated memory is still 202.9 MB. Free memory was 168.9 MB in the beginning and 165.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.45 ms. Allocated memory is still 202.9 MB. Free memory was 165.5 MB in the beginning and 110.4 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33506.56 ms. Allocated memory was 202.9 MB in the beginning and 480.2 MB in the end (delta: 277.3 MB). Free memory was 110.4 MB in the beginning and 303.0 MB in the end (delta: -192.5 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...