/usr/bin/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-simple/sll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:18:54,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:18:54,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:18:54,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:18:54,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:18:54,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:18:54,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:18:54,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:18:54,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:18:54,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:18:54,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:18:54,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:18:54,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:18:54,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:18:54,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:18:54,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:18:54,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:18:54,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:18:54,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:18:54,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:18:54,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:18:54,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:18:54,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:18:54,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:18:54,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:18:54,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:18:54,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:18:54,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:18:54,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:18:54,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:18:54,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:18:54,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:18:54,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:18:54,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:18:54,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:18:54,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:18:54,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:18:54,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:18:54,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:18:54,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:18:54,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:18:54,171 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-11-06 21:18:54,191 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:18:54,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:18:54,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:18:54,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:18:54,196 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:18:54,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:18:54,197 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:18:54,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:18:54,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:18:54,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:18:54,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:18:54,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:18:54,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:18:54,198 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:18:54,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:18:54,198 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:18:54,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:18:54,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:18:54,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:18:54,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:18:54,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:18:54,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:18:54,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:18:54,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:18:54,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:18:54,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:18:54,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:18:54,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:18:54,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:18:54,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:18:54,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:18:54,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:18:54,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:18:54,497 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:18:54,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2019-11-06 21:18:54,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b8f9006/33be201dae0c469c92dcb9f635fccfde/FLAG2c86f195f [2019-11-06 21:18:55,172 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:18:55,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2019-11-06 21:18:55,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b8f9006/33be201dae0c469c92dcb9f635fccfde/FLAG2c86f195f [2019-11-06 21:18:55,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b8f9006/33be201dae0c469c92dcb9f635fccfde [2019-11-06 21:18:55,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:18:55,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:18:55,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:18:55,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:18:55,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:18:55,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:18:55" (1/1) ... [2019-11-06 21:18:55,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf0de87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:55, skipping insertion in model container [2019-11-06 21:18:55,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:18:55" (1/1) ... [2019-11-06 21:18:55,433 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:18:55,484 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:18:55,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:18:55,911 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:18:55,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:18:56,032 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:18:56,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56 WrapperNode [2019-11-06 21:18:56,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:18:56,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:18:56,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:18:56,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:18:56,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (1/1) ... [2019-11-06 21:18:56,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (1/1) ... [2019-11-06 21:18:56,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (1/1) ... [2019-11-06 21:18:56,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (1/1) ... [2019-11-06 21:18:56,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (1/1) ... [2019-11-06 21:18:56,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (1/1) ... [2019-11-06 21:18:56,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (1/1) ... [2019-11-06 21:18:56,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:18:56,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:18:56,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:18:56,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:18:56,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (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-11-06 21:18:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:18:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:18:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:18:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:18:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:18:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-06 21:18:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-06 21:18:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-11-06 21:18:56,162 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2019-11-06 21:18:56,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:18:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:18:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:18:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:18:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:18:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:18:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:18:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:18:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:18:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:18:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:18:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:18:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:18:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:18:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:18:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:18:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:18:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:18:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:18:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:18:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:18:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:18:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:18:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:18:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:18:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:18:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:18:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:18:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:18:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:18:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:18:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:18:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:18:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:18:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:18:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:18:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:18:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:18:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:18:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:18:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:18:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:18:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:18:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:18:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:18:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:18:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:18:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:18:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:18:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:18:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:18:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:18:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:18:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:18:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:18:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:18:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:18:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:18:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:18:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:18:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:18:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:18:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:18:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:18:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:18:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:18:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:18:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:18:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:18:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:18:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:18:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:18:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:18:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:18:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:18:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:18:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:18:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:18:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:18:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:18:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:18:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:18:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:18:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:18:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:18:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:18:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:18:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:18:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:18:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:18:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:18:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:18:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:18:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:18:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:18:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-06 21:18:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:18:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:18:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:18:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-06 21:18:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-11-06 21:18:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:18:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:18:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2019-11-06 21:18:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:18:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:18:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-06 21:18:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:18:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:18:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:18:56,533 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:18:56,692 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:18:56,692 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 21:18:56,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:18:56 BoogieIcfgContainer [2019-11-06 21:18:56,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:18:56,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:18:56,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:18:56,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:18:56,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:18:55" (1/3) ... [2019-11-06 21:18:56,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28486bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:18:56, skipping insertion in model container [2019-11-06 21:18:56,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:56" (2/3) ... [2019-11-06 21:18:56,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28486bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:18:56, skipping insertion in model container [2019-11-06 21:18:56,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:18:56" (3/3) ... [2019-11-06 21:18:56,701 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2019-11-06 21:18:56,710 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:18:56,718 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:18:56,729 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:18:56,754 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:18:56,754 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:18:56,754 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:18:56,755 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:18:56,755 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:18:56,755 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:18:56,755 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:18:56,755 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:18:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-11-06 21:18:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:18:56,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:18:56,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:18:56,779 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:18:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:18:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1741018156, now seen corresponding path program 1 times [2019-11-06 21:18:56,794 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:18:56,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416498272] [2019-11-06 21:18:56,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:18:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:18:57,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416498272] [2019-11-06 21:18:57,137 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:18:57,137 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:18:57,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181920412] [2019-11-06 21:18:57,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:18:57,144 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:18:57,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:18:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:18:57,157 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2019-11-06 21:18:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:18:57,374 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2019-11-06 21:18:57,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:18:57,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-06 21:18:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:18:57,386 INFO L225 Difference]: With dead ends: 88 [2019-11-06 21:18:57,387 INFO L226 Difference]: Without dead ends: 38 [2019-11-06 21:18:57,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:18:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-06 21:18:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2019-11-06 21:18:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:18:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-11-06 21:18:57,437 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2019-11-06 21:18:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:18:57,437 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-11-06 21:18:57,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:18:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-11-06 21:18:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:18:57,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:18:57,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:18:57,440 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:18:57,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:18:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1529575644, now seen corresponding path program 1 times [2019-11-06 21:18:57,441 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:18:57,442 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058823512] [2019-11-06 21:18:57,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:18:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:18:57,607 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058823512] [2019-11-06 21:18:57,607 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:18:57,608 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:18:57,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064703687] [2019-11-06 21:18:57,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:18:57,610 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:18:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:18:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:18:57,611 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 7 states. [2019-11-06 21:18:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:18:57,812 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-11-06 21:18:57,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:18:57,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-06 21:18:57,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:18:57,814 INFO L225 Difference]: With dead ends: 58 [2019-11-06 21:18:57,814 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 21:18:57,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:18:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 21:18:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-11-06 21:18:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 21:18:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-06 21:18:57,825 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2019-11-06 21:18:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:18:57,825 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-06 21:18:57,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:18:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-06 21:18:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 21:18:57,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:18:57,827 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:18:57,828 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:18:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:18:57,828 INFO L82 PathProgramCache]: Analyzing trace with hash -937541417, now seen corresponding path program 1 times [2019-11-06 21:18:57,829 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:18:57,829 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485299916] [2019-11-06 21:18:57,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:18:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 21:18:58,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485299916] [2019-11-06 21:18:58,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133526847] [2019-11-06 21:18:58,054 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-11-06 21:18:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:18:58,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:18:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:18:58,320 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:18:58,322 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-06 21:18:58,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036399251] [2019-11-06 21:18:58,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 21:18:58,323 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:18:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 21:18:58,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:18:58,324 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 9 states. [2019-11-06 21:18:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:18:58,542 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-11-06 21:18:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:18:58,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-11-06 21:18:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:18:58,548 INFO L225 Difference]: With dead ends: 62 [2019-11-06 21:18:58,549 INFO L226 Difference]: Without dead ends: 41 [2019-11-06 21:18:58,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:18:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-06 21:18:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-06 21:18:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 21:18:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-06 21:18:58,558 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 37 [2019-11-06 21:18:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:18:58,558 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-06 21:18:58,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 21:18:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-06 21:18:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:18:58,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:18:58,561 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:18:58,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:18:58,762 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:18:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:18:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1717388092, now seen corresponding path program 2 times [2019-11-06 21:18:58,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:18:58,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155715097] [2019-11-06 21:18:58,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:18:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 21:18:59,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155715097] [2019-11-06 21:18:59,188 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:18:59,188 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:18:59,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288304315] [2019-11-06 21:18:59,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:18:59,190 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:18:59,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:18:59,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:18:59,191 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 13 states. [2019-11-06 21:18:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:18:59,653 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-06 21:18:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 21:18:59,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2019-11-06 21:18:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:18:59,656 INFO L225 Difference]: With dead ends: 45 [2019-11-06 21:18:59,656 INFO L226 Difference]: Without dead ends: 43 [2019-11-06 21:18:59,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:18:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-06 21:18:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-06 21:18:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 21:18:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-06 21:18:59,666 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 46 [2019-11-06 21:18:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:18:59,667 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-06 21:18:59,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:18:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-06 21:18:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:18:59,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:18:59,669 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:18:59,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:18:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:18:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1717386418, now seen corresponding path program 1 times [2019-11-06 21:18:59,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:18:59,670 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978073490] [2019-11-06 21:18:59,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:18:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:18:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 21:18:59,837 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978073490] [2019-11-06 21:18:59,837 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:18:59,837 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:18:59,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023023756] [2019-11-06 21:18:59,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:18:59,838 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:18:59,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:18:59,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:18:59,839 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 11 states. [2019-11-06 21:19:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:00,096 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-06 21:19:00,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:19:00,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-11-06 21:19:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:00,098 INFO L225 Difference]: With dead ends: 43 [2019-11-06 21:19:00,098 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 21:19:00,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:19:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 21:19:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-06 21:19:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 21:19:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-06 21:19:00,106 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 46 [2019-11-06 21:19:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:00,106 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-06 21:19:00,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:19:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-06 21:19:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 21:19:00,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:00,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:00,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1142561111, now seen corresponding path program 1 times [2019-11-06 21:19:00,109 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:00,110 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491754542] [2019-11-06 21:19:00,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:01,412 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-11-06 21:19:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:02,071 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-11-06 21:19:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 21:19:02,099 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491754542] [2019-11-06 21:19:02,099 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122311309] [2019-11-06 21:19:02,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:19:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:02,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 120 conjunts are in the unsatisfiable core [2019-11-06 21:19:02,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:19:02,418 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-11-06 21:19:02,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 21:19:02,461 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-11-06 21:19:02,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-06 21:19:02,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:19:02,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-06 21:19:02,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-06 21:19:02,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-06 21:19:02,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 21:19:02,782 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:02,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-06 21:19:02,805 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:02,820 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:56, output treesize:13 [2019-11-06 21:19:02,950 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:02,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:02,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:02,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2019-11-06 21:19:04,045 WARN L191 SmtUtils]: Spent 994.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-06 21:19:05,231 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-06 21:19:05,253 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|], 8=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|]} [2019-11-06 21:19:05,260 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:05,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:05,347 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:05,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:05,396 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:05,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:05,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:05,447 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:153, output treesize:192 [2019-11-06 21:19:11,785 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-06 21:19:11,834 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:11,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-06 21:19:11,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:11,965 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-06 21:19:11,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:11,968 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_BEFORE_CALL_4|], 16=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]} [2019-11-06 21:19:11,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:11,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:11,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2019-11-06 21:19:11,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:12,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:12,097 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 80 treesize of output 42 [2019-11-06 21:19:12,098 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:12,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:12,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 36 [2019-11-06 21:19:12,149 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,182 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:238, output treesize:86 [2019-11-06 21:19:12,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:12,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:19:12,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 55 [2019-11-06 21:19:12,375 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:12,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:12,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2019-11-06 21:19:12,406 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:14 [2019-11-06 21:19:12,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:19:12,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:12,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:12,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-06 21:19:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:19:12,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:19:12,605 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 36 [2019-11-06 21:19:12,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988263803] [2019-11-06 21:19:12,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-06 21:19:12,606 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:12,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-06 21:19:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1168, Unknown=3, NotChecked=0, Total=1260 [2019-11-06 21:19:12,608 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 36 states. [2019-11-06 21:19:14,373 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-06 21:19:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:15,788 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-06 21:19:15,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:19:15,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2019-11-06 21:19:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:15,791 INFO L225 Difference]: With dead ends: 47 [2019-11-06 21:19:15,791 INFO L226 Difference]: Without dead ends: 45 [2019-11-06 21:19:15,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=182, Invalid=2167, Unknown=3, NotChecked=0, Total=2352 [2019-11-06 21:19:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-06 21:19:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-11-06 21:19:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:19:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-06 21:19:15,800 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 48 [2019-11-06 21:19:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:15,800 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-06 21:19:15,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-06 21:19:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-06 21:19:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 21:19:15,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:15,802 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:16,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:19:16,006 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1142559437, now seen corresponding path program 1 times [2019-11-06 21:19:16,007 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:16,007 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507601541] [2019-11-06 21:19:16,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 21:19:16,499 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507601541] [2019-11-06 21:19:16,499 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669258765] [2019-11-06 21:19:16,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:19:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:16,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-06 21:19:16,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:19:16,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-11-06 21:19:16,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:16,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:16,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:16,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 21:19:20,921 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_26|], 8=[|v_#memory_$Pointer$.base_27|]} [2019-11-06 21:19:20,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:20,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-06 21:19:20,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:20,984 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-06 21:19:20,987 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:21,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:21,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:21,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:117 [2019-11-06 21:19:23,079 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-06 21:19:23,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:23,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:23,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:23,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:23,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 49 [2019-11-06 21:19:23,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:23,162 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-11-06 21:19:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:19:23,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:23,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:128, output treesize:50 [2019-11-06 21:19:23,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:19:23,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:19:23,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-11-06 21:19:23,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:23,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-11-06 21:19:23,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:23,264 INFO L567 ElimStorePlain]: treesize reduction 43, result has 42.7 percent of original size [2019-11-06 21:19:23,265 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-11-06 21:19:23,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:32 [2019-11-06 21:19:23,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:23,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2019-11-06 21:19:23,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:23,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:23,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:23,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:4 [2019-11-06 21:19:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:19:23,327 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:19:23,327 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 31 [2019-11-06 21:19:23,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356131402] [2019-11-06 21:19:23,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 21:19:23,328 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 21:19:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=851, Unknown=2, NotChecked=0, Total=930 [2019-11-06 21:19:23,329 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 31 states. [2019-11-06 21:19:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:24,443 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-06 21:19:24,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-06 21:19:24,444 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2019-11-06 21:19:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:24,445 INFO L225 Difference]: With dead ends: 45 [2019-11-06 21:19:24,446 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 21:19:24,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=161, Invalid=1643, Unknown=2, NotChecked=0, Total=1806 [2019-11-06 21:19:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 21:19:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-06 21:19:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:19:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-06 21:19:24,458 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 48 [2019-11-06 21:19:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:24,460 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-06 21:19:24,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-06 21:19:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-06 21:19:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 21:19:24,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:24,462 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:24,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:19:24,672 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1510353742, now seen corresponding path program 2 times [2019-11-06 21:19:24,673 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:24,673 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693851553] [2019-11-06 21:19:24,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:26,377 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-06 21:19:27,682 WARN L191 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2019-11-06 21:19:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:28,431 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-11-06 21:19:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:19:28,451 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693851553] [2019-11-06 21:19:28,451 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335283683] [2019-11-06 21:19:28,451 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 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-11-06 21:19:28,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:19:28,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:19:28,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 163 conjunts are in the unsatisfiable core [2019-11-06 21:19:28,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:19:28,741 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-11-06 21:19:28,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:28,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 21:19:28,780 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-11-06 21:19:28,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:28,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-06 21:19:28,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:19:28,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:28,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-06 21:19:28,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-06 21:19:28,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:28,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:28,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-06 21:19:28,983 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_27|], 2=[|v_#memory_int_29|]} [2019-11-06 21:19:28,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:28,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-11-06 21:19:28,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:29,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:29,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:29,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-11-06 21:19:29,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:29,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:29,066 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:29,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:29,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:29,088 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:88, output treesize:52 [2019-11-06 21:19:29,945 WARN L191 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-06 21:19:29,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:29,976 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-11-06 21:19:29,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,042 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-11-06 21:19:30,049 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 22 treesize of output 25 [2019-11-06 21:19:30,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:50 [2019-11-06 21:19:30,203 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 1=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|]} [2019-11-06 21:19:30,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:19:30,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-06 21:19:30,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-06 21:19:30,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,303 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:56 [2019-11-06 21:19:30,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-11-06 21:19:30,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:19:30,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-06 21:19:30,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2019-11-06 21:19:30,826 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:30,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:19:30,840 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:13 [2019-11-06 21:19:30,979 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:31,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:31,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:31,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2019-11-06 21:19:32,546 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-06 21:19:34,140 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-06 21:19:34,148 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_31|], 8=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_30|]} [2019-11-06 21:19:34,153 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:34,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:34,217 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:34,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:34,275 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:34,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:19:34,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-06 21:19:34,320 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:153, output treesize:192