java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:10:36,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:10:36,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:10:36,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:10:36,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:10:36,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:10:36,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:10:36,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:10:36,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:10:36,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:10:36,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:10:36,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:10:36,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:10:36,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:10:36,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:10:36,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:10:36,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:10:36,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:10:36,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:10:36,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:10:36,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:10:36,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:10:36,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:10:36,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:10:36,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:10:36,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:10:36,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:10:36,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:10:36,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:10:36,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:10:36,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:10:36,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:10:36,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:10:36,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:10:36,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:10:36,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:10:36,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:10:36,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:10:36,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:10:36,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:10:36,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:10:36,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:10:36,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:10:36,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:10:36,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:10:36,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:10:36,934 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:10:36,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:10:36,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:10:36,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:10:36,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:10:36,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:10:36,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:10:36,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:10:36,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:10:36,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:10:36,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:10:36,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:10:36,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:10:36,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:10:36,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:10:36,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:10:36,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:10:36,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:36,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:10:36,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:10:36,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:10:36,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:10:36,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:10:36,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:10:36,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:10:37,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:10:37,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:10:37,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:10:37,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:10:37,269 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:10:37,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-10-14 23:10:37,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463488d2e/3e664e6d537a4150bea07ece5e8738d8/FLAGb65465825 [2019-10-14 23:10:37,899 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:10:37,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-10-14 23:10:37,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463488d2e/3e664e6d537a4150bea07ece5e8738d8/FLAGb65465825 [2019-10-14 23:10:38,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463488d2e/3e664e6d537a4150bea07ece5e8738d8 [2019-10-14 23:10:38,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:10:38,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:10:38,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:38,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:10:38,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:10:38,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774ac415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38, skipping insertion in model container [2019-10-14 23:10:38,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,225 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:10:38,267 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:10:38,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:38,701 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:10:38,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:38,798 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:10:38,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38 WrapperNode [2019-10-14 23:10:38,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:38,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:10:38,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:10:38,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:10:38,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... [2019-10-14 23:10:38,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:10:38,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:10:38,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:10:38,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:10:38,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:10:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:10:38,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:10:38,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:10:38,934 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:10:38,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:10:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:10:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:10:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:10:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:10:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:10:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:10:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:10:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:10:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:10:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:10:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:10:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:10:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:10:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:10:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:10:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:10:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:10:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:10:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:10:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:10:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:10:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:10:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:10:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:10:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:10:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:10:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:10:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:10:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:10:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:10:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:10:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:10:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:10:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:10:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:10:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:10:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:10:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:10:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:10:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:10:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:10:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:10:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:10:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:10:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:10:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:10:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:10:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:10:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:10:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:10:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:10:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:10:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:10:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:10:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:10:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:10:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:10:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:10:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:10:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:10:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:10:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:10:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:10:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:10:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:10:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:10:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:10:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:10:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:10:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:10:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:10:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:10:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:10:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:10:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:10:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:10:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:10:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:10:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:10:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:10:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:10:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:10:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:10:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:10:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:10:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:10:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:10:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:10:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:10:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:10:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:10:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:10:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:10:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:10:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:10:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:10:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:10:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:10:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:10:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:10:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:10:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:10:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:10:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:10:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:10:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:10:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:10:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:10:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:10:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:10:39,344 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:10:39,513 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:10:39,514 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:10:39,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:39 BoogieIcfgContainer [2019-10-14 23:10:39,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:10:39,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:10:39,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:10:39,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:10:39,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:10:38" (1/3) ... [2019-10-14 23:10:39,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437d5bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:39, skipping insertion in model container [2019-10-14 23:10:39,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:38" (2/3) ... [2019-10-14 23:10:39,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437d5bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:39, skipping insertion in model container [2019-10-14 23:10:39,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:39" (3/3) ... [2019-10-14 23:10:39,525 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2019-10-14 23:10:39,537 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:10:39,547 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:10:39,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:10:39,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:10:39,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:10:39,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:10:39,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:10:39,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:10:39,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:10:39,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:10:39,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:10:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 23:10:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:10:39,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:39,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:39,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:39,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-10-14 23:10:39,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:39,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180336041] [2019-10-14 23:10:39,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:39,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180336041] [2019-10-14 23:10:39,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:39,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:10:39,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775722111] [2019-10-14 23:10:39,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:10:39,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:39,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:10:39,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:39,842 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-10-14 23:10:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:39,956 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-10-14 23:10:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:10:39,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-14 23:10:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:39,966 INFO L225 Difference]: With dead ends: 45 [2019-10-14 23:10:39,967 INFO L226 Difference]: Without dead ends: 22 [2019-10-14 23:10:39,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-14 23:10:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-14 23:10:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 23:10:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-14 23:10:40,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-10-14 23:10:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:40,010 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-14 23:10:40,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:10:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-14 23:10:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:10:40,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:40,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,012 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-10-14 23:10:40,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940269101] [2019-10-14 23:10:40,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:40,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940269101] [2019-10-14 23:10:40,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:40,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:10:40,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633793182] [2019-10-14 23:10:40,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:10:40,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:10:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:40,104 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-10-14 23:10:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:40,206 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-10-14 23:10:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:10:40,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-14 23:10:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:40,208 INFO L225 Difference]: With dead ends: 32 [2019-10-14 23:10:40,208 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 23:10:40,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 23:10:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 23:10:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:10:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-14 23:10:40,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-10-14 23:10:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:40,216 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-14 23:10:40,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:10:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-14 23:10:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:10:40,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:40,217 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,218 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-10-14 23:10:40,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854198495] [2019-10-14 23:10:40,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:40,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854198495] [2019-10-14 23:10:40,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:40,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:10:40,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541946931] [2019-10-14 23:10:40,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:10:40,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:10:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:10:40,312 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-10-14 23:10:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:40,418 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-14 23:10:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:40,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-14 23:10:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:40,420 INFO L225 Difference]: With dead ends: 43 [2019-10-14 23:10:40,420 INFO L226 Difference]: Without dead ends: 28 [2019-10-14 23:10:40,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-14 23:10:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-14 23:10:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-14 23:10:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-14 23:10:40,430 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-10-14 23:10:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:40,432 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-14 23:10:40,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:10:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-14 23:10:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:10:40,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:40,435 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,436 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-10-14 23:10:40,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812786211] [2019-10-14 23:10:40,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:10:40,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812786211] [2019-10-14 23:10:40,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:40,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:10:40,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488448451] [2019-10-14 23:10:40,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:10:40,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:10:40,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:10:40,575 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2019-10-14 23:10:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:40,659 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-14 23:10:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:10:40,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 23:10:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:40,661 INFO L225 Difference]: With dead ends: 36 [2019-10-14 23:10:40,661 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 23:10:40,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 23:10:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-10-14 23:10:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 23:10:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-14 23:10:40,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-10-14 23:10:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:40,668 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-14 23:10:40,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:10:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-14 23:10:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:40,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:40,669 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-10-14 23:10:40,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049047408] [2019-10-14 23:10:40,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:10:40,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049047408] [2019-10-14 23:10:40,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:40,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:40,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130725314] [2019-10-14 23:10:40,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:40,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:40,748 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-10-14 23:10:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:40,840 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-14 23:10:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:40,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-14 23:10:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:40,841 INFO L225 Difference]: With dead ends: 37 [2019-10-14 23:10:40,842 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 23:10:40,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 23:10:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-14 23:10:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-14 23:10:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-14 23:10:40,847 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-10-14 23:10:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:40,848 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-14 23:10:40,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-14 23:10:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:40,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:40,849 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-10-14 23:10:40,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504565368] [2019-10-14 23:10:40,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:40,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504565368] [2019-10-14 23:10:40,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62866332] [2019-10-14 23:10:40,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:41,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:10:41,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:41,118 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:41,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-14 23:10:41,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928163382] [2019-10-14 23:10:41,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:10:41,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:41,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:10:41,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:41,120 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-10-14 23:10:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:41,220 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-10-14 23:10:41,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:10:41,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-14 23:10:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:41,222 INFO L225 Difference]: With dead ends: 54 [2019-10-14 23:10:41,222 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 23:10:41,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:10:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 23:10:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-14 23:10:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:10:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 23:10:41,228 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-10-14 23:10:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:41,229 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 23:10:41,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:10:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 23:10:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:10:41,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:41,230 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:41,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:41,436 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-10-14 23:10:41,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:41,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878861250] [2019-10-14 23:10:41,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:41,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:41,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:41,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878861250] [2019-10-14 23:10:41,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568176871] [2019-10-14 23:10:41,568 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:41,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:41,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:41,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:10:41,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:41,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:41,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:41,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-10-14 23:10:41,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320410608] [2019-10-14 23:10:41,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:10:41,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:41,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:10:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:41,731 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-14 23:10:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:41,859 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-10-14 23:10:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:10:41,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-14 23:10:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:41,860 INFO L225 Difference]: With dead ends: 59 [2019-10-14 23:10:41,861 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 23:10:41,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 23:10:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-10-14 23:10:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 23:10:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-14 23:10:41,867 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-10-14 23:10:41,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:41,867 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-14 23:10:41,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:10:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-14 23:10:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:10:41,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:41,869 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:42,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,070 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:42,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-10-14 23:10:42,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:42,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380421497] [2019-10-14 23:10:42,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:42,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380421497] [2019-10-14 23:10:42,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752558648] [2019-10-14 23:10:42,151 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:10:42,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:42,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:10:42,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:42,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:42,312 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:42,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-10-14 23:10:42,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117954006] [2019-10-14 23:10:42,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:10:42,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:10:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:10:42,314 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2019-10-14 23:10:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:42,427 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-10-14 23:10:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:10:42,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-10-14 23:10:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:42,429 INFO L225 Difference]: With dead ends: 64 [2019-10-14 23:10:42,429 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 23:10:42,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:10:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 23:10:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-10-14 23:10:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 23:10:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-14 23:10:42,437 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-10-14 23:10:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:42,437 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-14 23:10:42,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:10:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-14 23:10:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:10:42,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:42,439 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:42,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,640 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-10-14 23:10:42,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:42,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386112862] [2019-10-14 23:10:42,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:42,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386112862] [2019-10-14 23:10:42,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103177779] [2019-10-14 23:10:42,746 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:10:42,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:42,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 23:10:42,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:42,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:42,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:43,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:43,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,048 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:43,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:10:43,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:10:43,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-10-14 23:10:43,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-10-14 23:10:43,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,291 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-10-14 23:10:43,319 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:10:43,320 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 66 treesize of output 40 [2019-10-14 23:10:43,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,359 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-10-14 23:10:43,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-10-14 23:10:43,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2019-10-14 23:10:43,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,512 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-10-14 23:10:43,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:43,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-10-14 23:10:43,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-10-14 23:10:43,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,779 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-10-14 23:10:43,865 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-10-14 23:10:43,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 95 [2019-10-14 23:10:43,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,877 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:43,943 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-10-14 23:10:43,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:43,945 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-10-14 23:10:44,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 161 [2019-10-14 23:10:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-10-14 23:10:44,197 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-14 23:10:44,197 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-10-14 23:10:44,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-10-14 23:10:44,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 84 [2019-10-14 23:10:44,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,469 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-10-14 23:10:44,469 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-10-14 23:10:44,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 155 [2019-10-14 23:10:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,497 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,587 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-10-14 23:10:44,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-10-14 23:10:44,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 245 [2019-10-14 23:10:44,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:44,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-10-14 23:10:45,072 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-10-14 23:10:45,073 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-10-14 23:10:45,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:45,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-10-14 23:10:45,157 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-10-14 23:10:45,162 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:45,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,640 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-10-14 23:10:45,641 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-10-14 23:10:45,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 317 treesize of output 361 [2019-10-14 23:10:45,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:45,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-10-14 23:10:46,483 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-10-14 23:10:46,483 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-10-14 23:10:46,485 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 1 xjuncts. [2019-10-14 23:10:46,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-10-14 23:10:46,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 295 treesize of output 215 [2019-10-14 23:10:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,694 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:46,768 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-10-14 23:10:46,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-10-14 23:10:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:46,815 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:46,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2019-10-14 23:10:46,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828844528] [2019-10-14 23:10:46,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 23:10:46,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:46,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 23:10:46,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:10:46,818 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 22 states. [2019-10-14 23:10:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:48,056 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-10-14 23:10:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 23:10:48,056 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-10-14 23:10:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:48,058 INFO L225 Difference]: With dead ends: 75 [2019-10-14 23:10:48,058 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 23:10:48,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 23:10:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 23:10:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-14 23:10:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 23:10:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-14 23:10:48,066 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-10-14 23:10:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:48,066 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-14 23:10:48,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 23:10:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-14 23:10:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:10:48,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:48,068 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:48,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:48,272 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:48,273 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-10-14 23:10:48,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:48,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798925610] [2019-10-14 23:10:48,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:48,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798925610] [2019-10-14 23:10:48,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315735629] [2019-10-14 23:10:48,400 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:48,709 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-14 23:10:48,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:48,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:10:48,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:48,732 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:48,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-14 23:10:48,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294900261] [2019-10-14 23:10:48,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:10:48,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:10:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:48,734 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 11 states. [2019-10-14 23:10:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:48,895 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-10-14 23:10:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:10:48,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-10-14 23:10:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:48,897 INFO L225 Difference]: With dead ends: 74 [2019-10-14 23:10:48,897 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 23:10:48,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:10:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 23:10:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-10-14 23:10:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:10:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-14 23:10:48,904 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-10-14 23:10:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:48,904 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-14 23:10:48,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:10:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-14 23:10:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:10:48,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:48,905 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:49,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:49,115 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:49,115 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-10-14 23:10:49,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:49,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100404219] [2019-10-14 23:10:49,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:49,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100404219] [2019-10-14 23:10:49,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063166381] [2019-10-14 23:10:49,245 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:49,801 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-14 23:10:49,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:49,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 23:10:49,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:49,831 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:49,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-10-14 23:10:49,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576653257] [2019-10-14 23:10:49,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:10:49,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:49,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:10:49,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:49,834 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 12 states. [2019-10-14 23:10:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:50,006 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-10-14 23:10:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:10:50,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-14 23:10:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:50,007 INFO L225 Difference]: With dead ends: 79 [2019-10-14 23:10:50,008 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 23:10:50,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:10:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 23:10:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-10-14 23:10:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:10:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-14 23:10:50,014 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-10-14 23:10:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:50,014 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-14 23:10:50,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:10:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-14 23:10:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-14 23:10:50,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:50,016 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:50,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:50,226 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-10-14 23:10:50,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:50,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026977713] [2019-10-14 23:10:50,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:50,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026977713] [2019-10-14 23:10:50,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396562377] [2019-10-14 23:10:50,371 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:50,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 23:10:50,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:50,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:50,518 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:50,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-10-14 23:10:50,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879444913] [2019-10-14 23:10:50,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 23:10:50,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 23:10:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:10:50,520 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 13 states. [2019-10-14 23:10:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:50,711 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-14 23:10:50,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:10:50,713 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-14 23:10:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:50,714 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:10:50,714 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:10:50,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:10:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:10:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-10-14 23:10:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:10:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-14 23:10:50,721 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-10-14 23:10:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:50,722 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-14 23:10:50,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 23:10:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-14 23:10:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:10:50,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:50,723 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:50,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:50,927 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-10-14 23:10:50,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:50,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31102485] [2019-10-14 23:10:50,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:51,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31102485] [2019-10-14 23:10:51,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211894184] [2019-10-14 23:10:51,098 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:51,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:51,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:51,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 23:10:51,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:51,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:51,245 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:51,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-10-14 23:10:51,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012255762] [2019-10-14 23:10:51,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:10:51,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:51,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:10:51,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:10:51,247 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 14 states. [2019-10-14 23:10:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:51,499 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-10-14 23:10:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:10:51,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-14 23:10:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:51,500 INFO L225 Difference]: With dead ends: 89 [2019-10-14 23:10:51,500 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 23:10:51,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:10:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 23:10:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-10-14 23:10:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-14 23:10:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-14 23:10:51,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-10-14 23:10:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:51,508 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-14 23:10:51,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:10:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-14 23:10:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-14 23:10:51,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:51,510 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:51,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:51,722 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-10-14 23:10:51,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:51,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863073203] [2019-10-14 23:10:51,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:51,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:51,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:51,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863073203] [2019-10-14 23:10:51,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773741856] [2019-10-14 23:10:51,904 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:53,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-14 23:10:53,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:53,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-14 23:10:53,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:53,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:53,251 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:53,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-10-14 23:10:53,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836135964] [2019-10-14 23:10:53,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:10:53,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:10:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:10:53,253 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 15 states. [2019-10-14 23:10:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:53,548 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-10-14 23:10:53,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:10:53,549 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-10-14 23:10:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:53,550 INFO L225 Difference]: With dead ends: 94 [2019-10-14 23:10:53,550 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 23:10:53,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:10:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 23:10:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-10-14 23:10:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-14 23:10:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-14 23:10:53,558 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-10-14 23:10:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:53,558 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-14 23:10:53,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:10:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-14 23:10:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-14 23:10:53,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:53,560 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:53,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:53,771 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-10-14 23:10:53,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:53,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767094938] [2019-10-14 23:10:53,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:53,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:53,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-14 23:10:54,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767094938] [2019-10-14 23:10:54,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960145336] [2019-10-14 23:10:54,421 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:54,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:10:54,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:54,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 120 conjunts are in the unsatisfiable core [2019-10-14 23:10:54,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:54,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:54,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:54,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:54,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,837 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-10-14 23:10:54,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:54,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-10-14 23:10:54,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:54,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:54,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:54,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-10-14 23:10:54,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,031 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-10-14 23:10:55,035 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 19 treesize of output 18 [2019-10-14 23:10:55,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-10-14 23:10:55,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:55,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-10-14 23:10:55,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-10-14 23:10:55,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,290 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-10-14 23:10:55,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:55,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-10-14 23:10:55,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:55,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-10-14 23:10:55,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 129 [2019-10-14 23:10:55,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,665 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-14 23:10:55,665 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-10-14 23:10:55,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:55,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-10-14 23:10:55,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:55,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-10-14 23:10:55,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 159 [2019-10-14 23:10:55,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,142 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-14 23:10:56,142 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-10-14 23:10:56,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:56,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:56,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-10-14 23:10:56,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:56,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:56,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-10-14 23:10:56,797 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-14 23:10:56,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 189 [2019-10-14 23:10:56,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,135 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-10-14 23:10:57,136 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-10-14 23:10:57,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:57,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,278 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-14 23:10:57,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-10-14 23:10:59,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, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:59,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,594 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-14 23:10:59,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:59,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-10-14 23:11:00,249 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-14 23:11:00,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 219 [2019-10-14 23:11:00,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,573 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-10-14 23:11:00,573 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-10-14 23:11:00,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:11:00,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,723 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-14 23:11:00,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,726 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-10-14 23:11:05,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:05,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:05,478 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-14 23:11:05,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:05,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:05,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-10-14 23:11:15,366 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-14 23:11:15,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 52 treesize of output 249 [2019-10-14 23:11:15,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,780 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-10-14 23:11:15,780 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-10-14 23:11:15,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:11:15,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,965 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-10-14 23:11:15,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:15,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200