java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/min_max.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:12:51,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:12:51,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:12:51,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:12:51,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:12:51,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:12:51,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:12:51,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:12:51,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:12:51,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:12:51,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:12:51,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:12:51,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:12:51,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:12:51,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:12:51,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:12:51,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:12:51,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:12:51,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:12:51,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:12:51,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:12:51,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:12:51,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:12:51,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:12:51,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:12:51,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:12:51,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:12:51,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:12:51,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:12:51,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:12:51,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:12:51,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:12:51,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:12:51,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:12:51,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:12:51,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:12:51,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:12:51,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:12:51,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:12:51,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:12:51,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:12:51,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:12:51,910 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:12:51,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:12:51,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:12:51,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:12:51,912 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:12:51,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:12:51,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:12:51,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:12:51,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:12:51,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:12:51,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:12:51,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:12:51,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:12:51,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:12:51,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:12:51,914 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:12:51,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:12:51,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:12:51,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:12:51,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:12:51,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:12:51,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:12:51,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:12:51,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:12:51,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:12:51,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:12:51,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:12:51,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:12:51,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:12:51,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:12:51,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:12:51,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:12:51,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:12:51,962 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:12:51,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max.i [2019-09-08 02:12:52,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faeae5a5e/f1b749e1b14d4664806b7c994650f57e/FLAG5e2618b69 [2019-09-08 02:12:52,558 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:12:52,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max.i [2019-09-08 02:12:52,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faeae5a5e/f1b749e1b14d4664806b7c994650f57e/FLAG5e2618b69 [2019-09-08 02:12:52,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faeae5a5e/f1b749e1b14d4664806b7c994650f57e [2019-09-08 02:12:52,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:12:52,861 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:12:52,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:12:52,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:12:52,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:12:52,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:12:52" (1/1) ... [2019-09-08 02:12:52,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626c6038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:52, skipping insertion in model container [2019-09-08 02:12:52,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:12:52" (1/1) ... [2019-09-08 02:12:52,876 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:12:52,913 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:12:53,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:12:53,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:12:53,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:12:53,490 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:12:53,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53 WrapperNode [2019-09-08 02:12:53,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:12:53,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:12:53,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:12:53,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:12:53,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... [2019-09-08 02:12:53,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... [2019-09-08 02:12:53,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... [2019-09-08 02:12:53,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... [2019-09-08 02:12:53,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... [2019-09-08 02:12:53,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... [2019-09-08 02:12:53,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... [2019-09-08 02:12:53,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:12:53,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:12:53,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:12:53,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:12:53,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:12:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:12:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:12:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 02:12:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 02:12:53,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:12:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:12:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:12:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 02:12:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 02:12:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 02:12:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 02:12:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 02:12:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 02:12:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 02:12:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 02:12:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 02:12:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 02:12:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 02:12:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 02:12:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 02:12:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 02:12:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 02:12:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 02:12:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 02:12:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 02:12:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 02:12:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 02:12:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 02:12:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 02:12:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 02:12:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 02:12:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 02:12:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 02:12:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 02:12:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 02:12:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 02:12:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 02:12:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 02:12:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 02:12:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 02:12:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 02:12:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 02:12:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 02:12:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 02:12:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 02:12:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 02:12:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 02:12:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 02:12:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 02:12:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 02:12:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 02:12:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 02:12:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 02:12:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 02:12:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 02:12:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 02:12:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 02:12:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 02:12:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 02:12:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 02:12:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 02:12:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 02:12:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 02:12:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 02:12:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 02:12:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 02:12:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 02:12:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 02:12:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 02:12:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 02:12:53,632 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 02:12:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 02:12:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 02:12:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 02:12:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 02:12:53,633 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 02:12:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 02:12:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 02:12:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 02:12:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 02:12:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 02:12:53,634 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 02:12:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 02:12:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 02:12:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 02:12:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 02:12:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 02:12:53,635 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 02:12:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 02:12:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 02:12:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 02:12:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 02:12:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 02:12:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 02:12:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 02:12:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 02:12:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 02:12:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 02:12:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 02:12:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 02:12:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 02:12:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 02:12:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 02:12:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 02:12:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 02:12:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 02:12:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 02:12:53,639 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 02:12:53,639 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 02:12:53,639 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 02:12:53,639 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 02:12:53,639 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 02:12:53,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:12:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 02:12:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:12:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 02:12:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:12:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 02:12:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:12:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:12:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:12:54,076 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:12:54,076 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 02:12:54,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:12:54 BoogieIcfgContainer [2019-09-08 02:12:54,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:12:54,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:12:54,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:12:54,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:12:54,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:12:52" (1/3) ... [2019-09-08 02:12:54,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6723443d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:12:54, skipping insertion in model container [2019-09-08 02:12:54,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:12:53" (2/3) ... [2019-09-08 02:12:54,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6723443d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:12:54, skipping insertion in model container [2019-09-08 02:12:54,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:12:54" (3/3) ... [2019-09-08 02:12:54,085 INFO L109 eAbstractionObserver]: Analyzing ICFG min_max.i [2019-09-08 02:12:54,095 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:12:54,104 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 02:12:54,121 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 02:12:54,147 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:12:54,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:12:54,148 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:12:54,148 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:12:54,148 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:12:54,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:12:54,149 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:12:54,149 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:12:54,149 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:12:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-08 02:12:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-08 02:12:54,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:54,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:54,176 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1192142104, now seen corresponding path program 1 times [2019-09-08 02:12:54,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:54,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:12:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:12:54,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:12:54,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:12:54,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:12:54,320 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-08 02:12:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:54,341 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-08 02:12:54,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:12:54,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-09-08 02:12:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:54,350 INFO L225 Difference]: With dead ends: 39 [2019-09-08 02:12:54,350 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 02:12:54,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:12:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 02:12:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 02:12:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 02:12:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-09-08 02:12:54,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2019-09-08 02:12:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:54,393 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-09-08 02:12:54,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:12:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-09-08 02:12:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:12:54,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:54,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:54,395 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:54,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1107899532, now seen corresponding path program 1 times [2019-09-08 02:12:54,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:54,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:54,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:54,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:12:54,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:12:54,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:12:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:12:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:12:54,546 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2019-09-08 02:12:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:54,619 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-08 02:12:54,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:12:54,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 02:12:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:54,622 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:12:54,623 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 02:12:54,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:12:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 02:12:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 02:12:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 02:12:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-08 02:12:54,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2019-09-08 02:12:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:54,635 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-08 02:12:54,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:12:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-08 02:12:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:12:54,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:54,637 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:54,638 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 897845277, now seen corresponding path program 1 times [2019-09-08 02:12:54,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:54,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:12:54,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 02:12:54,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:12:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:12:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:12:54,897 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-09-08 02:12:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:55,078 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-08 02:12:55,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:12:55,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-08 02:12:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:55,079 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:12:55,080 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:12:55,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:12:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:12:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-08 02:12:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:12:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-08 02:12:55,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-09-08 02:12:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:55,091 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-08 02:12:55,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:12:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-08 02:12:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:12:55,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:55,093 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:55,094 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash -458989665, now seen corresponding path program 1 times [2019-09-08 02:12:55,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:55,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:55,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:12:55,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 02:12:55,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:12:55,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:12:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:12:55,331 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-09-08 02:12:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:55,563 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-08 02:12:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:12:55,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-09-08 02:12:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:55,564 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:12:55,564 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:12:55,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:12:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:12:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-09-08 02:12:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:12:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-08 02:12:55,572 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-09-08 02:12:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:55,573 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-08 02:12:55,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:12:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-08 02:12:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:12:55,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:55,574 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:55,574 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:55,574 INFO L82 PathProgramCache]: Analyzing trace with hash 221068705, now seen corresponding path program 1 times [2019-09-08 02:12:55,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:55,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:55,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:12:55,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 02:12:55,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:12:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:12:55,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:12:55,748 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-09-08 02:12:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:55,948 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-08 02:12:55,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:12:55,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-08 02:12:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:55,950 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:12:55,950 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 02:12:55,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:12:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 02:12:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-09-08 02:12:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:12:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-08 02:12:55,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-09-08 02:12:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:55,963 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-08 02:12:55,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:12:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-08 02:12:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:12:55,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:55,965 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:55,966 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1418643305, now seen corresponding path program 1 times [2019-09-08 02:12:55,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:55,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:55,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:56,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:12:56,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:12:56,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:12:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:56,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:12:56,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:12:56,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:56,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:56,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:56,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:56,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-09-08 02:12:56,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:12:56,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:56,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:12:56,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:56,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-09-08 02:12:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:56,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:12:56,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-09-08 02:12:56,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:12:56,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:12:56,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:12:56,326 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-09-08 02:12:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:56,469 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-09-08 02:12:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:12:56,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-08 02:12:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:56,471 INFO L225 Difference]: With dead ends: 48 [2019-09-08 02:12:56,471 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:12:56,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:12:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:12:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-08 02:12:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:12:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-08 02:12:56,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2019-09-08 02:12:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:56,481 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-08 02:12:56,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:12:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-08 02:12:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 02:12:56,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:56,483 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:56,483 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1939400262, now seen corresponding path program 2 times [2019-09-08 02:12:56,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:56,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:56,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:12:56,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:12:56,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:12:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:12:56,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:12:56,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:12:56,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 02:12:56,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:12:56,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-08 02:12:56,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:56,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-08 02:12:56,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-09-08 02:12:56,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:56,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:56,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-09-08 02:12:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:12:56,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:12:56,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-09-08 02:12:56,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:12:56,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:12:56,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:12:56,741 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 9 states. [2019-09-08 02:12:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:56,952 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-09-08 02:12:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:12:56,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-09-08 02:12:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:56,953 INFO L225 Difference]: With dead ends: 90 [2019-09-08 02:12:56,954 INFO L226 Difference]: Without dead ends: 71 [2019-09-08 02:12:56,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:12:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-08 02:12:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-09-08 02:12:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:12:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-08 02:12:56,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-08 02:12:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:56,962 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-08 02:12:56,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:12:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-08 02:12:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 02:12:56,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:56,963 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:56,963 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:56,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1681234824, now seen corresponding path program 1 times [2019-09-08 02:12:56,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:56,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:56,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:56,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:12:56,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:57,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:12:57,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:12:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:12:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:57,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:12:57,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:12:57,263 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-09-08 02:12:57,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:12:57,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,317 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-09-08 02:12:57,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,351 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_9|, |v_#memory_$Pointer$.base_9|], 4=[|v_#memory_int_11|]} [2019-09-08 02:12:57,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:57,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:57,387 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:12:57,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:12:57,423 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,441 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-09-08 02:12:57,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-09-08 02:12:57,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:12:57,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:12:57,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-09-08 02:12:57,637 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 32 treesize of output 12 [2019-09-08 02:12:57,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:57,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:57,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-08 02:12:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:57,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:12:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-09-08 02:12:57,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:12:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:12:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:12:57,679 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 16 states. [2019-09-08 02:12:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:58,317 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-08 02:12:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:12:58,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-09-08 02:12:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:58,323 INFO L225 Difference]: With dead ends: 71 [2019-09-08 02:12:58,324 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 02:12:58,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:12:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 02:12:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-09-08 02:12:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 02:12:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-09-08 02:12:58,332 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 27 [2019-09-08 02:12:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:58,333 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-09-08 02:12:58,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:12:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-09-08 02:12:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 02:12:58,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:58,334 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:58,334 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:58,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1344449784, now seen corresponding path program 1 times [2019-09-08 02:12:58,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:58,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:58,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:58,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:12:58,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:12:58,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:58,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:12:58,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:12:58,548 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-09-08 02:12:58,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:12:58,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 02:12:58,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,643 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|, |v_#memory_$Pointer$.base_10|], 4=[|v_#memory_int_12|]} [2019-09-08 02:12:58,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:58,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:58,667 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:12:58,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:12:58,686 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,697 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-08 02:12:58,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-08 02:12:58,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:12:58,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-08 02:12:58,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:12:58,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:58,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:58,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:12:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:58,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:12:58,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-09-08 02:12:58,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:12:58,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:12:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:12:58,813 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 14 states. [2019-09-08 02:12:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:12:59,415 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-08 02:12:59,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:12:59,416 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-09-08 02:12:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:12:59,417 INFO L225 Difference]: With dead ends: 65 [2019-09-08 02:12:59,417 INFO L226 Difference]: Without dead ends: 63 [2019-09-08 02:12:59,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:12:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-08 02:12:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-09-08 02:12:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:12:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-08 02:12:59,427 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2019-09-08 02:12:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:12:59,428 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-08 02:12:59,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:12:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-08 02:12:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:12:59,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:12:59,431 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:12:59,431 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:12:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:12:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash -758836934, now seen corresponding path program 1 times [2019-09-08 02:12:59,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:12:59,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:12:59,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:59,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:59,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:12:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:59,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:12:59,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:12:59,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:12:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:12:59,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:12:59,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:12:59,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-08 02:12:59,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:12:59,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,726 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-09-08 02:12:59,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,748 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_11|, |v_#memory_$Pointer$.base_11|], 4=[|v_#memory_int_13|]} [2019-09-08 02:12:59,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:59,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:12:59,776 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:12:59,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:12:59,798 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,812 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-08 02:12:59,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-08 02:12:59,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:12:59,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-08 02:12:59,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:12:59,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:12:59,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:12:59,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:12:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:12:59,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:12:59,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-09-08 02:12:59,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:12:59,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:12:59,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:12:59,923 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2019-09-08 02:13:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:00,686 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2019-09-08 02:13:00,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:13:00,687 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-09-08 02:13:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:00,688 INFO L225 Difference]: With dead ends: 92 [2019-09-08 02:13:00,688 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 02:13:00,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:13:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 02:13:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2019-09-08 02:13:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 02:13:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-09-08 02:13:00,699 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 29 [2019-09-08 02:13:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:00,700 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-09-08 02:13:00,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:13:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-09-08 02:13:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:13:00,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:00,701 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:00,701 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash -768788038, now seen corresponding path program 1 times [2019-09-08 02:13:00,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:00,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:00,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:00,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:00,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:13:00,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:01,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:13:01,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:01,035 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-09-08 02:13:01,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:01,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,063 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-09-08 02:13:01,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,088 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 4=[|v_#memory_int_14|]} [2019-09-08 02:13:01,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:01,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:01,118 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:01,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:01,143 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,159 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:33 [2019-09-08 02:13:01,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-09-08 02:13:01,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:13:01,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:01,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-09-08 02:13:01,364 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 32 treesize of output 12 [2019-09-08 02:13:01,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:01,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:01,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-08 02:13:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-09-08 02:13:01,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:13:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:13:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:13:01,381 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 18 states. [2019-09-08 02:13:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:02,286 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2019-09-08 02:13:02,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:13:02,287 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-09-08 02:13:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:02,288 INFO L225 Difference]: With dead ends: 113 [2019-09-08 02:13:02,288 INFO L226 Difference]: Without dead ends: 111 [2019-09-08 02:13:02,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:13:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-08 02:13:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-09-08 02:13:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-08 02:13:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-08 02:13:02,298 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-09-08 02:13:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:02,299 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-08 02:13:02,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:13:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-08 02:13:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:13:02,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:02,300 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:02,301 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1436663426, now seen corresponding path program 2 times [2019-09-08 02:13:02,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:02,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:13:02,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:02,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:13:02,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:02,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:13:02,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:02,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:13:02,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:02,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-08 02:13:02,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:02,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:02,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:02,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-08 02:13:02,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-09-08 02:13:02,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:02,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:02,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:02,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-09-08 02:13:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:13:02,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:02,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-09-08 02:13:02,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:13:02,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:13:02,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:13:02,477 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 10 states. [2019-09-08 02:13:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:02,678 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2019-09-08 02:13:02,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:13:02,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-08 02:13:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:02,682 INFO L225 Difference]: With dead ends: 145 [2019-09-08 02:13:02,682 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 02:13:02,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:13:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 02:13:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2019-09-08 02:13:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 02:13:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-09-08 02:13:02,701 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 29 [2019-09-08 02:13:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:02,701 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-09-08 02:13:02,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:13:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-09-08 02:13:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:13:02,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:02,704 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:02,704 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1847186620, now seen corresponding path program 1 times [2019-09-08 02:13:02,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:02,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:13:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:02,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:02,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:02,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:02,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:13:02,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:02,991 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-09-08 02:13:02,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:02,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:03,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,033 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-09-08 02:13:03,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,060 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_13|, |v_#memory_$Pointer$.offset_13|], 4=[|v_#memory_int_15|]} [2019-09-08 02:13:03,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:03,068 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:03,095 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:03,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:03,120 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,138 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-08 02:13:03,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-08 02:13:03,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:13:03,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,232 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-08 02:13:03,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:13:03,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:03,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:03,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:13:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:03,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:03,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-09-08 02:13:03,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:13:03,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:13:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:13:03,278 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 15 states. [2019-09-08 02:13:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:04,463 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-09-08 02:13:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:13:04,463 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-09-08 02:13:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:04,464 INFO L225 Difference]: With dead ends: 92 [2019-09-08 02:13:04,464 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 02:13:04,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:13:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 02:13:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2019-09-08 02:13:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 02:13:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-09-08 02:13:04,472 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 29 [2019-09-08 02:13:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:04,472 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-09-08 02:13:04,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:13:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-09-08 02:13:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:13:04,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:04,474 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:04,474 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1837235516, now seen corresponding path program 1 times [2019-09-08 02:13:04,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:04,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:04,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:04,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:04,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:04,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:04,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:04,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:04,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:13:04,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:04,973 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-09-08 02:13:04,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:04,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:04,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:04,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:05,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,066 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-09-08 02:13:05,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,108 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_14|], 4=[|v_#memory_int_16|]} [2019-09-08 02:13:05,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:05,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:05,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:05,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:05,197 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,216 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-09-08 02:13:05,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-09-08 02:13:05,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:13:05,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:05,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:30 [2019-09-08 02:13:05,497 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 30 treesize of output 10 [2019-09-08 02:13:05,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:05,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:05,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-09-08 02:13:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:05,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:05,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-09-08 02:13:05,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:13:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:13:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:13:05,540 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 21 states. [2019-09-08 02:13:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:08,115 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-09-08 02:13:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:13:08,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-09-08 02:13:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:08,117 INFO L225 Difference]: With dead ends: 135 [2019-09-08 02:13:08,117 INFO L226 Difference]: Without dead ends: 133 [2019-09-08 02:13:08,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=327, Invalid=1835, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:13:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-08 02:13:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 39. [2019-09-08 02:13:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:13:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-08 02:13:08,128 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2019-09-08 02:13:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:08,128 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-08 02:13:08,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:13:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-08 02:13:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:13:08,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:08,134 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:08,135 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2094339090, now seen corresponding path program 2 times [2019-09-08 02:13:08,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:08,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:08,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:08,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:08,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:13:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:08,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:13:08,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:08,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:13:08,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:08,337 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-09-08 02:13:08,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:08,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:08,360 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,367 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-09-08 02:13:08,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,384 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-09-08 02:13:08,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-08 02:13:08,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:13:08,447 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-08 02:13:08,474 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:13:08,490 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,501 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-09-08 02:13:08,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-09-08 02:13:08,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:08,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:08,596 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:08,613 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-09-08 02:13:08,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-09-08 02:13:08,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:08,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:08,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-09-08 02:13:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:08,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:08,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-09-08 02:13:08,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:13:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:13:08,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:13:08,634 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2019-09-08 02:13:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:09,021 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-08 02:13:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:13:09,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-08 02:13:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:09,022 INFO L225 Difference]: With dead ends: 67 [2019-09-08 02:13:09,022 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:13:09,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:13:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:13:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-08 02:13:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 02:13:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-09-08 02:13:09,028 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 32 [2019-09-08 02:13:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:09,028 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-09-08 02:13:09,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:13:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-09-08 02:13:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:13:09,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:09,029 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:09,030 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 934068797, now seen corresponding path program 3 times [2019-09-08 02:13:09,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:09,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:09,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:09,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:13:09,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:09,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:09,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:09,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:13:09,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:13:09,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:09,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 02:13:09,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:09,457 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-09-08 02:13:09,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:09,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,542 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-09-08 02:13:09,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,599 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-09-08 02:13:09,600 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|], 4=[|v_#memory_int_17|]} [2019-09-08 02:13:09,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:09,604 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:09,632 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:09,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:09,658 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,677 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-09-08 02:13:09,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-08 02:13:09,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,824 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 4=[|v_#memory_int_18|]} [2019-09-08 02:13:09,830 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:09,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,874 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:09,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:09,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:09,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-09-08 02:13:09,913 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:09,974 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-09-08 02:13:09,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:09,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:09,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-09-08 02:13:09,983 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:10,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:10,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:10,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-09-08 02:13:10,026 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:10,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:10,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:10,075 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:71 [2019-09-08 02:13:10,420 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-08 02:13:10,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 55 [2019-09-08 02:13:10,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:10,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:10,423 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:10,459 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-09-08 02:13:10,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:10,481 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-09-08 02:13:10,482 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:10,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:10,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:10,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2019-09-08 02:13:10,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-08 02:13:10,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:10,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:10,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:10,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-08 02:13:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:10,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:10,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-09-08 02:13:10,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:13:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:13:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:13:10,588 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 26 states. [2019-09-08 02:13:11,753 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 02:13:12,197 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 02:13:13,000 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-08 02:13:13,180 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 02:13:13,402 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 02:13:13,764 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-08 02:13:13,953 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 02:13:14,196 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-08 02:13:14,620 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-08 02:13:15,332 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-08 02:13:15,878 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-08 02:13:16,215 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 02:13:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:16,645 INFO L93 Difference]: Finished difference Result 279 states and 305 transitions. [2019-09-08 02:13:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:13:16,646 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-09-08 02:13:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:16,648 INFO L225 Difference]: With dead ends: 279 [2019-09-08 02:13:16,648 INFO L226 Difference]: Without dead ends: 277 [2019-09-08 02:13:16,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=566, Invalid=3340, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 02:13:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-08 02:13:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 93. [2019-09-08 02:13:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 02:13:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-09-08 02:13:16,667 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 37 [2019-09-08 02:13:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:16,668 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-09-08 02:13:16,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:13:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2019-09-08 02:13:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:13:16,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:16,671 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:16,671 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash 833472957, now seen corresponding path program 1 times [2019-09-08 02:13:16,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:16,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:13:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:17,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:17,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:17,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:17,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 02:13:17,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:17,103 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-09-08 02:13:17,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:17,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,175 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-09-08 02:13:17,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,214 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 4=[|v_#memory_int_19|]} [2019-09-08 02:13:17,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:17,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:17,259 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:17,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-09-08 02:13:17,296 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,319 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:56 [2019-09-08 02:13:17,431 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_22|], 9=[|v_#memory_int_20|]} [2019-09-08 02:13:17,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:17,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-09-08 02:13:17,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,495 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:17,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:17,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 43 [2019-09-08 02:13:17,551 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,624 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.1 percent of original size [2019-09-08 02:13:17,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 51 [2019-09-08 02:13:17,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,643 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:17,713 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.1 percent of original size [2019-09-08 02:13:17,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:17,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:13:17,749 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:17,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 75 [2019-09-08 02:13:17,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,754 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:17,885 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 02:13:17,886 INFO L567 ElimStorePlain]: treesize reduction 34, result has 79.6 percent of original size [2019-09-08 02:13:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:17,890 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:132, output treesize:143 [2019-09-08 02:13:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:17,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:18,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:18,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:18,252 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 02:13:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:13:18,414 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 02:13:18,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:13:18,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:13:18,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:18,742 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 75 treesize of output 62 [2019-09-08 02:13:18,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:18,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:13:18,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:18,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 63 [2019-09-08 02:13:18,756 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:18,774 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-08 02:13:18,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 76 [2019-09-08 02:13:18,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:18,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:18,776 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:18,868 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.7 percent of original size [2019-09-08 02:13:18,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:18,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:18,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2019-09-08 02:13:18,885 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:18,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:18,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:18,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2019-09-08 02:13:18,904 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:18,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:18,912 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 44 treesize of output 43 [2019-09-08 02:13:18,912 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:18,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:18,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-09-08 02:13:18,943 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:270, output treesize:88 [2019-09-08 02:13:19,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:13:19,035 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_4, |#memory_int|], 3=[v_prenex_6]} [2019-09-08 02:13:19,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:19,043 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 28 treesize of output 20 [2019-09-08 02:13:19,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:19,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:19,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:19,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:19,077 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 30 treesize of output 22 [2019-09-08 02:13:19,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:19,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:19,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:19,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:19,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 41 [2019-09-08 02:13:19,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:19,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:19,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:19,115 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:19,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:19,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-08 02:13:19,134 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:100, output treesize:11 [2019-09-08 02:13:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:19,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:19,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-09-08 02:13:19,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:13:19,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:13:19,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:13:19,190 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 25 states. [2019-09-08 02:13:20,528 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-09-08 02:13:20,766 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-08 02:13:21,018 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-08 02:13:21,549 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-09-08 02:13:21,953 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2019-09-08 02:13:23,039 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-09-08 02:13:23,646 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-09-08 02:13:24,007 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 153 [2019-09-08 02:13:25,038 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-08 02:13:25,398 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 155 [2019-09-08 02:13:26,124 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-08 02:13:26,408 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 99 [2019-09-08 02:13:26,646 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-08 02:13:27,225 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 02:13:27,506 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 101 [2019-09-08 02:13:28,538 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 02:13:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:28,898 INFO L93 Difference]: Finished difference Result 453 states and 500 transitions. [2019-09-08 02:13:28,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 02:13:28,898 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-09-08 02:13:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:28,900 INFO L225 Difference]: With dead ends: 453 [2019-09-08 02:13:28,900 INFO L226 Difference]: Without dead ends: 451 [2019-09-08 02:13:28,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1163, Invalid=6147, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 02:13:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-08 02:13:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 120. [2019-09-08 02:13:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-08 02:13:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2019-09-08 02:13:28,918 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 37 [2019-09-08 02:13:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:28,918 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2019-09-08 02:13:28,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:13:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2019-09-08 02:13:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:13:28,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:28,919 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:28,919 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash 581200573, now seen corresponding path program 2 times [2019-09-08 02:13:28,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:28,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:28,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:13:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:29,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:29,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:13:29,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:13:29,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:29,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 02:13:29,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:29,244 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-09-08 02:13:29,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:29,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,300 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-09-08 02:13:29,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,347 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-09-08 02:13:29,351 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|], 4=[|v_#memory_int_21|]} [2019-09-08 02:13:29,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:29,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:29,380 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:29,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:29,402 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,419 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-09-08 02:13:29,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-08 02:13:29,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,548 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_25|], 4=[|v_#memory_int_22|]} [2019-09-08 02:13:29,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2019-09-08 02:13:29,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-09-08 02:13:29,610 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-08 02:13:29,685 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:13:29,728 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:29,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-09-08 02:13:29,769 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:29,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:29,835 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:144, output treesize:97 [2019-09-08 02:13:30,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:30,171 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 99 treesize of output 66 [2019-09-08 02:13:30,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:30,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:30,174 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:30,215 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2019-09-08 02:13:30,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-09-08 02:13:30,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:30,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:30,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:30,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:24 [2019-09-08 02:13:30,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:30,299 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 28 treesize of output 20 [2019-09-08 02:13:30,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:30,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:30,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:30,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:30,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-09-08 02:13:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:30,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:30,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-09-08 02:13:30,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:13:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:13:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:13:30,378 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand 22 states. [2019-09-08 02:13:31,109 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-08 02:13:31,276 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-09-08 02:13:31,754 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-08 02:13:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:31,819 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2019-09-08 02:13:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:13:31,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-09-08 02:13:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:31,821 INFO L225 Difference]: With dead ends: 164 [2019-09-08 02:13:31,821 INFO L226 Difference]: Without dead ends: 162 [2019-09-08 02:13:31,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:13:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-08 02:13:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2019-09-08 02:13:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 02:13:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2019-09-08 02:13:31,837 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 37 [2019-09-08 02:13:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:31,837 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2019-09-08 02:13:31,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:13:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2019-09-08 02:13:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:13:31,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:31,838 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:31,839 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash 480604733, now seen corresponding path program 2 times [2019-09-08 02:13:31,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:31,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:31,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:13:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:32,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:32,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:32,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:13:32,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:13:32,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:32,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 02:13:32,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:32,203 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-09-08 02:13:32,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:32,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,309 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-09-08 02:13:32,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,380 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-09-08 02:13:32,382 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_int_23|]} [2019-09-08 02:13:32,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:32,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:32,423 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:32,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-09-08 02:13:32,451 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,474 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:79, output treesize:58 [2019-09-08 02:13:32,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-08 02:13:32,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,768 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|], 10=[|v_#memory_int_24|]} [2019-09-08 02:13:32,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-08 02:13:32,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,836 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:32,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:13:32,885 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:32,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2019-09-08 02:13:32,932 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:32,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:32,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:32,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2019-09-08 02:13:32,977 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:33,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:33,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:33,016 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:163, output treesize:140 [2019-09-08 02:13:33,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:33,321 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 151 treesize of output 98 [2019-09-08 02:13:33,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:33,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:33,323 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:33,351 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.6 percent of original size [2019-09-08 02:13:33,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2019-09-08 02:13:33,355 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:33,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:33,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:33,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:49 [2019-09-08 02:13:33,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:33,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2019-09-08 02:13:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:33,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:33,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:33,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:33,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:3 [2019-09-08 02:13:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:33,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:33,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-09-08 02:13:33,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:13:33,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:13:33,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:13:33,477 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand 24 states. [2019-09-08 02:13:35,528 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-09-08 02:13:35,661 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-08 02:13:35,960 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 49 [2019-09-08 02:13:36,361 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 02:13:36,565 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-09-08 02:13:36,710 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-08 02:13:36,905 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-08 02:13:37,136 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2019-09-08 02:13:37,323 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 02:13:37,599 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 02:13:37,818 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-08 02:13:38,023 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-08 02:13:38,175 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-08 02:13:38,386 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-08 02:13:38,658 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 77 [2019-09-08 02:13:38,846 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-08 02:13:39,017 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-08 02:13:39,188 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 02:13:39,800 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-08 02:13:40,135 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 02:13:40,355 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 82 [2019-09-08 02:13:40,537 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 02:13:40,944 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-08 02:13:41,126 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 02:13:41,422 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-08 02:13:41,641 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 84 [2019-09-08 02:13:41,807 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 02:13:42,072 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-08 02:13:42,648 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 02:13:42,832 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2019-09-08 02:13:43,729 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 02:13:43,921 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2019-09-08 02:13:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:44,622 INFO L93 Difference]: Finished difference Result 397 states and 441 transitions. [2019-09-08 02:13:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 02:13:44,623 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2019-09-08 02:13:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:44,625 INFO L225 Difference]: With dead ends: 397 [2019-09-08 02:13:44,625 INFO L226 Difference]: Without dead ends: 395 [2019-09-08 02:13:44,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1960, Invalid=7352, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 02:13:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-08 02:13:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 49. [2019-09-08 02:13:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 02:13:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-09-08 02:13:44,640 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 37 [2019-09-08 02:13:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:44,640 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-09-08 02:13:44,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:13:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-09-08 02:13:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:13:44,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:44,642 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:44,642 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash -7925313, now seen corresponding path program 3 times [2019-09-08 02:13:44,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:44,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:44,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:13:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:44,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:44,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:44,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:13:44,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:13:44,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:44,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 02:13:44,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:45,003 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-09-08 02:13:45,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:45,040 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,041 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-09-08 02:13:45,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,106 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-09-08 02:13:45,107 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_int_25|]} [2019-09-08 02:13:45,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:45,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:45,140 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:45,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:45,169 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,187 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-09-08 02:13:45,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-08 02:13:45,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,298 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|, |v_#memory_$Pointer$.base_32|], 4=[|v_#memory_int_26|]} [2019-09-08 02:13:45,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-08 02:13:45,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,347 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:45,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:13:45,386 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:45,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-09-08 02:13:45,418 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,466 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.3 percent of original size [2019-09-08 02:13:45,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:45,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-09-08 02:13:45,473 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,493 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:129, output treesize:65 [2019-09-08 02:13:45,637 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-08 02:13:45,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 51 [2019-09-08 02:13:45,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:45,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:45,640 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:45,669 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.8 percent of original size [2019-09-08 02:13:45,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,677 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-09-08 02:13:45,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,687 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:11 [2019-09-08 02:13:45,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:13:45,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:45,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:45,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:13:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:45,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:45,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2019-09-08 02:13:45,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:13:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:13:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:13:45,731 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 18 states. [2019-09-08 02:13:46,651 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 02:13:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:48,132 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2019-09-08 02:13:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:13:48,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-09-08 02:13:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:48,134 INFO L225 Difference]: With dead ends: 147 [2019-09-08 02:13:48,135 INFO L226 Difference]: Without dead ends: 145 [2019-09-08 02:13:48,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:13:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-08 02:13:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2019-09-08 02:13:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-08 02:13:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-09-08 02:13:48,154 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 39 [2019-09-08 02:13:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:48,155 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-09-08 02:13:48,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:13:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-09-08 02:13:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:13:48,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:48,156 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:48,156 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2103720255, now seen corresponding path program 2 times [2019-09-08 02:13:48,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:48,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:48,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:48,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:13:48,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:48,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:48,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:48,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:13:48,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:13:48,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:48,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 02:13:48,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:48,579 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-09-08 02:13:48,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:48,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,625 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-09-08 02:13:48,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,674 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-09-08 02:13:48,675 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|], 4=[|v_#memory_int_27|]} [2019-09-08 02:13:48,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:48,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:48,707 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:48,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:48,732 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,747 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-09-08 02:13:48,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-08 02:13:48,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,851 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.offset_34|], 4=[|v_#memory_int_28|]} [2019-09-08 02:13:48,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2019-09-08 02:13:48,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-09-08 02:13:48,930 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:48,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:48,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-08 02:13:48,974 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:49,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:49,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:13:49,019 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:49,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:49,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:49,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-09-08 02:13:49,063 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:49,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:49,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:49,082 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:132, output treesize:85 [2019-09-08 02:13:49,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:49,320 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 117 treesize of output 72 [2019-09-08 02:13:49,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:49,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:49,323 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:49,355 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.7 percent of original size [2019-09-08 02:13:49,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-09-08 02:13:49,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:49,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:49,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:49,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:32 [2019-09-08 02:13:49,419 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 32 treesize of output 12 [2019-09-08 02:13:49,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:49,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:49,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:49,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-08 02:13:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:49,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:49,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2019-09-08 02:13:49,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:13:49,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:13:49,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:13:49,488 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 25 states. [2019-09-08 02:13:50,463 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-09-08 02:13:50,696 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-08 02:13:50,964 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-08 02:13:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:13:51,780 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2019-09-08 02:13:51,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:13:51,781 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2019-09-08 02:13:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:13:51,782 INFO L225 Difference]: With dead ends: 173 [2019-09-08 02:13:51,783 INFO L226 Difference]: Without dead ends: 171 [2019-09-08 02:13:51,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:13:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-08 02:13:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 93. [2019-09-08 02:13:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 02:13:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-09-08 02:13:51,804 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 39 [2019-09-08 02:13:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:13:51,804 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-09-08 02:13:51,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:13:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2019-09-08 02:13:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:13:51,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:13:51,805 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:13:51,805 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:13:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:13:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash 188127807, now seen corresponding path program 3 times [2019-09-08 02:13:51,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:13:51,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:13:51,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:51,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:13:51,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:13:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:13:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:52,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:13:52,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:13:52,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:13:52,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:13:52,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:13:52,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 02:13:52,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:13:52,300 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-09-08 02:13:52,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:13:52,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,359 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-09-08 02:13:52,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,429 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.4 percent of original size [2019-09-08 02:13:52,431 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|], 4=[|v_#memory_int_29|]} [2019-09-08 02:13:52,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:52,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 02:13:52,476 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:52,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-08 02:13:52,522 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,549 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:84, output treesize:59 [2019-09-08 02:13:52,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-08 02:13:52,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,762 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|], 9=[|v_#memory_int_30|]} [2019-09-08 02:13:52,766 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:52,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,815 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:52,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:52,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-09-08 02:13:52,859 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,919 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2019-09-08 02:13:52,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:52,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:52,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-09-08 02:13:52,927 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:52,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:13:52,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2019-09-08 02:13:52,969 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:52,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:52,994 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:140, output treesize:84 [2019-09-08 02:13:53,181 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-08 02:13:53,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 62 [2019-09-08 02:13:53,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:13:53,184 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:53,222 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-09-08 02:13:53,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:53,235 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-09-08 02:13:53,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:53,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:53,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:13:53,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:26 [2019-09-08 02:13:53,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-08 02:13:53,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:13:53,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:13:53,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:13:53,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-08 02:13:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:13:53,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:13:53,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2019-09-08 02:13:53,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:13:53,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:13:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:13:53,312 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 25 states. [2019-09-08 02:13:55,824 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-08 02:13:56,292 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-08 02:13:56,541 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2019-09-08 02:13:56,733 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-08 02:13:56,954 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-08 02:13:57,105 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 02:13:57,695 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 88 [2019-09-08 02:13:58,429 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 88 [2019-09-08 02:13:58,967 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-08 02:13:59,173 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 87 [2019-09-08 02:13:59,914 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2019-09-08 02:14:00,131 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-09-08 02:14:00,288 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-08 02:14:00,442 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-08 02:14:00,901 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-08 02:14:01,268 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-08 02:14:01,481 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-09-08 02:14:01,633 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-08 02:14:01,797 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-08 02:14:02,282 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-08 02:14:02,476 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-08 02:14:03,106 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-08 02:14:03,303 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-09-08 02:14:03,452 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 02:14:03,614 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 02:14:03,989 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-08 02:14:04,194 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-09-08 02:14:04,335 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 02:14:04,481 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 02:14:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:05,174 INFO L93 Difference]: Finished difference Result 500 states and 547 transitions. [2019-09-08 02:14:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 02:14:05,177 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2019-09-08 02:14:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:05,181 INFO L225 Difference]: With dead ends: 500 [2019-09-08 02:14:05,181 INFO L226 Difference]: Without dead ends: 498 [2019-09-08 02:14:05,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1363, Invalid=9143, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 02:14:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-08 02:14:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 131. [2019-09-08 02:14:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-08 02:14:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2019-09-08 02:14:05,213 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 39 [2019-09-08 02:14:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:05,214 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2019-09-08 02:14:05,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:14:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2019-09-08 02:14:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:14:05,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:05,215 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:05,215 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:05,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1378278081, now seen corresponding path program 2 times [2019-09-08 02:14:05,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:05,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:05,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:14:05,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 02:14:05,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:05,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:14:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:14:05,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:14:05,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:14:05,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:14:05,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:05,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-08 02:14:05,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:05,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:05,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:05,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2019-09-08 02:14:05,434 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_int|], 4=[|v_#memory_int_31|]} [2019-09-08 02:14:05,436 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:05,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:05,449 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:05,450 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 38 treesize of output 40 [2019-09-08 02:14:05,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:05,453 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_192], 2=[v_arrayElimCell_191]} [2019-09-08 02:14:05,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:14:05,664 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) 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.doElimOneRec(ElimStorePlain.java:256) 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.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) 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) [2019-09-08 02:14:05,671 INFO L168 Benchmark]: Toolchain (without parser) took 72810.58 ms. Allocated memory was 133.7 MB in the beginning and 558.4 MB in the end (delta: 424.7 MB). Free memory was 88.1 MB in the beginning and 113.4 MB in the end (delta: -25.3 MB). Peak memory consumption was 399.4 MB. Max. memory is 7.1 GB. [2019-09-08 02:14:05,671 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:14:05,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.49 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 87.9 MB in the beginning and 165.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:14:05,671 INFO L168 Benchmark]: Boogie Preprocessor took 73.47 ms. Allocated memory is still 200.8 MB. Free memory was 165.6 MB in the beginning and 162.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-08 02:14:05,672 INFO L168 Benchmark]: RCFGBuilder took 512.73 ms. Allocated memory is still 200.8 MB. Free memory was 162.8 MB in the beginning and 123.6 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:14:05,672 INFO L168 Benchmark]: TraceAbstraction took 71591.05 ms. Allocated memory was 200.8 MB in the beginning and 558.4 MB in the end (delta: 357.6 MB). Free memory was 123.6 MB in the beginning and 113.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 367.7 MB. Max. memory is 7.1 GB. [2019-09-08 02:14:05,675 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.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 626.49 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 87.9 MB in the beginning and 165.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.47 ms. Allocated memory is still 200.8 MB. Free memory was 165.6 MB in the beginning and 162.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 512.73 ms. Allocated memory is still 200.8 MB. Free memory was 162.8 MB in the beginning and 123.6 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71591.05 ms. Allocated memory was 200.8 MB in the beginning and 558.4 MB in the end (delta: 357.6 MB). Free memory was 123.6 MB in the beginning and 113.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 367.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...